惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Google DeepMind News
Google DeepMind News
U
Unit 42
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
J
Java Code Geeks
D
DataBreaches.Net
B
Blog RSS Feed
D
Docker
L
LangChain Blog
aimingoo的专栏
aimingoo的专栏
F
Fortinet All Blogs
Y
Y Combinator Blog
A
About on SuperTechFans
V
V2EX
罗磊的独立博客
WordPress大学
WordPress大学
宝玉的分享
宝玉的分享
MongoDB | Blog
MongoDB | Blog
博客园 - 【当耐特】
Last Week in AI
Last Week in AI
S
SegmentFault 最新的问题
月光博客
月光博客
Vercel News
Vercel News
H
Hackread – Cybersecurity News, Data Breaches, AI and More
阮一峰的网络日志
阮一峰的网络日志

cs updates on arXiv.org

Beyond Binary Edits Robust Multimodal Knowledge Editing with Adversarial Subspace Alignment Agentic Proving for Program Verification MemAudit: Post-hoc Auditing of Poisoned Agent Memory via Causal Attribution and Structural Anomaly Detection OpenSkillEval: Automatically Auditing the Open Skill Ecosystem for LLM Agents One Policy, Infinite NPCs: Persona-Traceable Shared RL Policies for Scalable Game Agents How Human-Like Are Large Language Models? A Register-Aware Linguistic Evaluation Framework Benchmarking Google Embeddings 2 against Open-Source Models for Multilingual Dense Retrieval and RAG Systems Structure-Guided Entity Resolution: Fine-Tuning LLMs for Robust Name Matching in Complex Linguistic Contexts Solving the Aircraft Disassembly Scheduling Problem Co-ReAct: Rubrics as Step-Level Collaborators for ReAct Agents CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem Asking For An Old Friend: Diagnosing and Mitigating Temporal Failure Modes in LLM-based Statutory Question Answering EDGE-OPD: Internalizing Privileged Context with Evidence Guided On-Policy Distillation ARES: Automated Rubric Synthesis for Scalable LLM Reinforcement Learning SSDAU: Structured Semantic Data Augmentation for Joint Entity and Relation Extraction Naturalistic measure of social norms alignment Articulatory strategy as a source of variation in acoustic vowel dynamics When Planning Fails Despite Correct Execution: On Epistemic Calibration for LLM-Based Multi-Agent Systems EquiSumm : A Gender Bias-Aware Framework for Inclusive Tweet Summarization Metacognition as Reward: Reinforcing LLM Reasoning via Knowledge and Regulation Signals From Correctness to Preference: A Framework for Personalized Agentic Reinforcement Learning Cultural Adaptation in Large Language Models for Political Discourse Emotion Recognition in Sign Language Conversation ClimateChat-300K: A Multi-Modal Facebook Dataset for Understanding Diverse Perspectives in Climate Communication AraHopeCorpus: Annotation Guidelines and Dataset for Hope Speech in Arabic Social Media Crisis Discourse Human-in-the-Loop Multi-Agent Ventilator Decision Support with Contextual Bandit Preference Learning Convergence Without Understanding: When Language Models Agree on Representations but Disagree on Reasoning DART: Semantic Recoverability for Structured Tool Agents Ontological Knowledge Blocks: Executable Compliance and Profile-Based Validation for Trustworthy AI Systems Parallel Context Compaction for Long-Horizon LLM Agent Serving
LQR based stabilization of an 1D heat equation with advec...
[Submitted on 17 Jun 2026] · 2026-06-18 · via cs updates on arXiv.org

View PDF HTML (experimental)

Abstract:We derive a one-dimensional model for heat transfer in a moving fluid incorporating Fourier conduction, an exponentially decaying memory term, and advection under thermally insulated boundary conditions. We numerically construct a bounded state feedback law driving the closed-loop solution to zero exponentially with decay rate at least $\omega>0$ for every initial state, i.e., we solve the $\omega$-stabilization problem. We explicitly describe the eigenvalues of the state operator $A$, a subset of which converges to a finite negative accumulation point that sets the upper bound on the achievable decay rate. Since $A$ lacks compact resolvent, we show that the spectrum is the closure of its eigenvalues, each of finite algebraic multiplicity, and use this to verify stabilizability. For $\omega$ below the accumulation bound, the problem is solvable provided the control operator $B$ satisfies a non-orthogonality condition. To compute gains, we formulate an LQR problem and solve finite-dimensional approximations: for each $n$ we construct $A_n$, $B_n$ approximating $A$, $B$ and solve the associated algebraic Riccati equation for a gain $K_n$. We show that, for all sufficiently large $n$, $K_n$ can be chosen so every eigenvalue of $A_n+B_nK_n$ satisfies $\operatorname{Re}\lambda<-\omega$, and we establish stabilizability of $(A_n+\omega I,B_n)$ uniformly in $n$. Hence, for large $n$, these gains solve the $\omega$-stabilization problem for the original system. We validate the results numerically with an example.

Submission history

From: Bhargav Pavan Kumar Sistla [view email]
[v1] Wed, 17 Jun 2026 07:20:25 UTC (417 KB)