Aug 2026· 2 citations· ⚡ 1 influential· 24 references
MathematicsComputer ScienceEngineering
Abstract
The low-rank alternating direction implicit (ADI) method is an efficient solver for large-scale Stein equations with low-rank solutions. This paper shows that, as in the continuous-time Lyapunov equation case, the low-rank Cholesky factor ADI (LRCF-ADI) method for Stein equations implicitly performs $\mathcal{H}_2$-pseudo-optimal model order reduction for discrete-time systems. This observation leads to an automatic shift-generation strategy, allowing LRCF-ADI to select subsequent shifts without user intervention. The standard LRCF-ADI method requires shifts outside the unit circle. We generalize the method to allow shifts anywhere in the complex plane, including on the unit circle. This extension enables numerical integration for frequency-limited Stein equations by interpolating the integrand at points on the unit circle. It also enables non-intrusive, data-driven balanced truncation and frequency-limited balanced truncation using experimentally measurable transfer function samples on the unit circle, without requiring access to a state-space realization. Numerical results for large-scale models demonstrate the effectiveness of the proposed methods as low-rank Stein equation solvers and data-driven model order reduction methods.
Discrete-time non-symmetric algebraic Riccati equations (DTNAREs) arise in game-theoretic computations of Nash equilibria. Solving such equations at large scale is often computationally prohibitive. This paper develops a numerical approach for large-scale DTNAREs whose solutions are low rank. A low-rank alternating dir...
The low-rank alternating direction implicit (ADI) method is an efficient numerical technique for solving several types of large-scale matrix equations that admit low-rank solutions. The discrete-time algebraic Riccati equation (DARE) is an important matrix equation with applications in state estimation, controller desi...
This paper introduces four groups of subspace methods for nonlinear monotone equations, with applications to large-scale machine learning problems. The methods use Jacobian-free subspace ({\tt JFS}) directions of conjugate-gradient type, combined with either fixed step sizes or variable step sizes generated by the proj...
M. Kimiaei, Shima Shabani, Michael Breuß· 0 citations
An Askey-type confluence scheme is developed for Jacobi multiple orthogonal systems of mixed type, with $q$ row weights and $p$ column weights. Rescaling the Jacobi variable near $0$ and near $1$ produces Laguerre systems of the first and second kinds. A Hermite system with one Gaussian--gamma row and $q-1$ exponential...
Dynamical low-rank approximation has become a widely used numerical method in diverse disciplines. Its main idea is to represent the matrix or tensor-valued solution to a time-dependent differential equation as a low-rank factorization. The evolution of the factorization leads to highly stiff dynamics and requires the...
Cory D. Hauck, Jonas Kusch, Steffen Schotthöfer· 0 citations
This paper investigates the problem of model-order reduction for linear systems arising from minimum-phase circuits and filters, where stability and frequency characteristics must be preserved. The MPPBT framework uses a Riccati–Lyapunov Gramian pair and constructs a balancing transformation with the sequence of MPPBT...
Thang Ngoc Pham, H. T. Nguyen, H. Vu et al.· Applied Sciences· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.