The DOI matches its Crossref record; 91 of the 91 references it cites were found in a registry or an index.
Computational Methods for Linear Matrix Equations
Open accessAbstract
Given the square matrices $A, B, D, E$ and the matrix $C$ of conforming dimensions, we consider the linear matrix equation $A{\mathbf X} E+D{\mathbf X} B = C$ in the unknown matrix ${\mathbf X}$. Our aim is to provide an overview of the major algorithmic developments that have taken place over the past few decades in the numerical solution of this and related problems, which are producing reliable numerical tools in the formulation and solution of advanced mathematical models in engineering and scientific computing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of Mathematical Functions
McQuarrie, D. A. (1966) · American Journal of Physics · doi:10.1119/1.1972842 · Cited by 40,433
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Horn, R. A., & Johnson, C. R. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511840371 · Cited by 9,319
Gantmacher, F. R. (1984) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 8,520
Faires, J. D. (1978) · Cited by 6,711
Kailath, T. (1980) · Cited by 6,215
Principal component analysis in linear systems: Controllability, observability, and model reduction
Moore, B. (1981) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1981.1102568 · Cited by 5,282
Approximation of Large-Scale Dynamical Systems
Antoulas, A. C. (2005) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718713 · Cited by 3,655
The Numerical Solution of Parabolic and Elliptic Differential Equations
Peaceman, D. W., & Rachford, Jr. (1955) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0103003 · Cited by 3,255
Lehoucq, R. B., Sorensen, D. C., & Yang, C. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719628 · Cited by 2,936
The general problem of the stability of motion
LYAPUNOV, A. M. (1992) · International Journal of Control · doi:10.1080/00207179208934253 · Cited by 2,550
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90038-5 · Cited by 2,437
Accuracy and stability of numerical algorithms
(1996) · Choice Reviews Online · doi:10.5860/choice.34-0981 · Cited by 2,072
Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
Bartels, R. H., & Stewart, G. W. (1972) · Communications of the ACM · doi:10.1145/361573.361582 · Cited by 1,932
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
Observers for multivariable systems
Luenberger, D. (1966) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1966.1098323 · Cited by 1,763
An Algorithm for Generalized Matrix Eigenvalue Problems
Moler, C., & Stewart, G. W. (1973) · SIAM Journal on Numerical Analysis · doi:10.1137/0710024 · Cited by 1,224
(2006) · Indefinite Linear Algebra and Applications · doi:10.1007/3-7643-7350-4_14 · Cited by 1,115
Jump linear systems in automatic control
Mariton, M. (1990) · Cited by 1,032
Lecture notes in computational science and engineering
Viola, I. M., Ponzini, R., Rocchi, D., & Fossati, F. (2010) · Cited by 901
Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
Babuska, I. M., Tempone, R. F., & Zouraris, G. E. (2004) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142902418680 · Cited by 877
Model Order Reduction: Theory, Research Aspects and Applications
(2008) · Mathematics in Industry · doi:10.1007/978-3-540-78841-6 · Cited by 810
On Krylov Subspace Approximations to the Matrix Exponential Operator
Hochbruck, M., & Lubich, C. (1997) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142995280572 · Cited by 795
Differential-Algebraic Equations: Analysis and Numerical Solution
Kunkel, P., & Mehrmann, V. (2006) · Cited by 733
$\mathcal{H}_2$ Model Reduction for Large-Scale Linear Dynamical Systems
Gugercin, S., Antoulas, A. C., & Beattie, C. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060666123 · Cited by 670
A literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
Stewart, G. W. (1973) · SIAM Review · doi:10.1137/1015095 · Cited by 573
TT-cross approximation for multidimensional arrays
Oseledets, I., & Tyrtyshnikov, E. (2010) · Linear Algebra and its Applications · doi:10.1016/j.laa.2009.07.024 · Cited by 555
Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
Oseledets, I. V., & Tyrtyshnikov, E. E. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/090748330 · Cited by 459
Iterative least-squares solutions of coupled Sylvester matrix equations
Ding, F., & Chen, T. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.06.008 · Cited by 422
A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
Penzl, T. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598347666 · Cited by 403
Recent computational developments in Krylov subspace methods for linear systems
Simoncini, V., & Szyld, D. B. (2007) · Numerical Linear Algebra with Applications · doi:10.1002/nla.499 · Cited by 375
Self-citationBenner, P., Li, J., & Penzl, T. (2008) · Numerical Linear Algebra with Applications · doi:10.1002/nla.622 · Cited by 343
A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
Simoncini, V. (2007) · SIAM Journal on Scientific Computing · doi:10.1137/06066120x · Cited by 334
Self-citationLow Rank Solution of Lyapunov Equations
Li, J., & White, J. (2002) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479801384937 · Cited by 333
Krylov Subspace Methods for Solving Large Lyapunov Equations
Jaimoukha, I. M., & Kasenally, E. M. (1994) · SIAM Journal on Numerical Analysis · doi:10.1137/0731012 · Cited by 305
How and Why to Solve the Operator Equation AX −XB = Y
Bhatia, R., & Rosenthal, P. (1997) · Bulletin of the London Mathematical Society · doi:10.1112/s0024609396001828 · Cited by 295
Numerical Methods for Linear Control Systems
Boley, D., & Datta, B. N. (1997) · Systems and Control in the Twenty-First Century · doi:10.1007/978-1-4612-4120-1_4 · Cited by 226
Solving the algebraic Riccati equation with the matrix sign function
Byers, R. (1987) · Linear Algebra and its Applications · doi:10.1016/0024-3795(87)90222-9 · Cited by 204
A projection method to solve linear systems in tensor format
Ballani, J., & Grasedyck, L. (2013) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1818 · Cited by 203
Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
Kressner, D., & Tobler, C. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100799010 · Cited by 193
Tensors-structured numerical methods in scientific computing: Survey on recent advances
Khoromskij, B. N. (2012) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2011.09.001 · Cited by 189
Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
Gohbert, I., Kailath, T., & Olshevsky, V. (1995) · Mathematics of Computation · doi:10.2307/2153371 · Cited by 189
Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
Hale, N., Higham, N. J., & Trefethen, L. N. (2008) · SIAM Journal on Numerical Analysis · doi:10.1137/070700607 · Cited by 187
On the decay rate of Hankel singular values and related issues
Antoulas, A. C., Sorensen, D. C., & Zhou, Y. (2002) · Systems & Control Letters · doi:10.1016/s0167-6911(02)00147-0 · Cited by 182
Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
Güttel, S. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310002 · Cited by 172
RD-Rational Approximations of the Matrix Exponential
Moret, I., & Novati, P. (2004) · BIT Numerical Mathematics · doi:10.1023/b:bitn.0000046805.27551.3b · Cited by 167
Error Estimates and Evaluation of Matrix Functions via the Faber Transform
Beckermann, B., & Reichel, L. (2009) · SIAM Journal on Numerical Analysis · doi:10.1137/080741744 · Cited by 159
A Restarted Krylov Subspace Method for the Evaluation of Matrix Functions
Eiermann, M., & Ernst, O. G. (2006) · SIAM Journal on Numerical Analysis · doi:10.1137/050633846 · Cited by 139
Solving stable generalized Lyapunov equations with the matrix sign function
Benner, P., & Quintana–Ort́ı, E. S. (1999) · Numerical Algorithms · doi:10.1023/a:1019191431273 · Cited by 138
Numerical linear algebra aspects of control design computations
Laub, A. J. (1985) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1985.1103900 · Cited by 136
Jonsson, I., & Kågström, B. (2002) · ACM Transactions on Mathematical Software · doi:10.1145/592843.592845 · Cited by 119
A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations
Vandereycken, B., & Vandewalle, S. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090764566 · Cited by 108
Solution of Large Scale Evolutionary Problems Using Rational Krylov Subspaces with Optimized Shifts
Druskin, V. L., Knizhnerman, L., & Zaslavsky, M. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080742403 · Cited by 105
Direct methods for matrix Sylvester and Lyapunov equations
Sorensen, D. C., & Zhou, Y. (2003) · Journal of Applied Mathematics · doi:10.1155/s1110757x03212055 · Cited by 98
Implicitly Restarted Krylov Subspace Methods for Stable Partial Realizations
Jaimoukha, I. M., & Kasenally, E. M. (1997) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895279873 · Cited by 93
On Smith-type iterative algorithms for the Stein matrix equation
Zhou, B., Lam, J., & Duan, G. (2009) · Applied Mathematics Letters · doi:10.1016/j.aml.2009.01.012 · Cited by 91
Reduced order observers: A new algorithm and proof
Dooren, P. M. V. (1984) · Systems & Control Letters · doi:10.1016/s0167-6911(84)80033-x · Cited by 82
Numerical Linear Algebra Techniques for Systems and Control
Patel, R. V., Laub, A. J., & Dooren, P. M. V. (1993) · Cited by 80
Rational Krylov Methods for Operator Functions
Güttel, S. (2010) · MIMS EPrints (University of Southampton) · Cited by 73
New approach to robust observer design
Tsui, C.-C. (1988) · International Journal of Control · doi:10.1080/00207178808906052 · Cited by 62
Convergence analysis of the extended Krylov subspace method for the Lyapunov equation
Knizhnerman, L., & Simoncini, V. (2011) · Numerische Mathematik · doi:10.1007/s00211-011-0366-3 · Cited by 59
Self-citationFactorized Solution of Lyapunov Equations Based on Hierarchical Matrix Arithmetic
Baur, U., & Benner, P. (2006) · Computing · doi:10.1007/s00607-006-0178-y · Cited by 59
On the numerical solution ofAX −XB =C
Simoncini, V. (1996) · BIT Numerical Mathematics · doi:10.1007/bf01733793 · Cited by 57
Self-citationNumerical solution and perturbation theory for generalized Lyapunov equations
Stykel, T. (2002) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(02)00255-0 · Cited by 51
Structured Condition Numbers for Invariant Subspaces
Byers, R., & Kreßner, D. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/050637601 · Cited by 47
Linear and numerical linear algebra in control theory: some research problems
Datta, B. N. (1994) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)90512-6 · Cited by 46
Nonsingular solutions of TA−BT=C
Hearon, J. Z. (1977) · Linear Algebra and its Applications · doi:10.1016/0024-3795(77)90019-2 · Cited by 45
A mixed-precision algorithm for the solution of Lyapunov equations on hybrid CPU–GPU platforms
Benner, P., Ezzatti, P., Kreßner, D., Quintana–Ort́ı, E. S., & Remón, A. (2010) · Parallel Computing · doi:10.1016/j.parco.2010.12.002 · Cited by 41
The extended Krylov subspace method and orthogonal Laurent polynomials
Jagels, C., & Reichel, L. (2009) · Linear Algebra and its Applications · doi:10.1016/j.laa.2009.03.006 · Cited by 40
Rational approximation to trigonometric operators
Grimm, V., & Hochbruck, M. (2008) · BIT Numerical Mathematics · doi:10.1007/s10543-008-0185-9 · Cited by 36
Convergence Analysis of Projection Methods for the Numerical Solution of Large Lyapunov Equations
Simoncini, V., & Druskin, V. L. (2009) · SIAM Journal on Numerical Analysis · doi:10.1137/070699378 · Cited by 35
Self-citationFormal derivation of algorithms: The triangular sylvester equation
Quintana–Ort́ı, E. S., & Geijn, R. A. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/779359.779365 · Cited by 32
On the solution of large Sylvester‐observer equations
Daniela Calvetti, A., Lewis, B. W., & Lothar Reichel, B. (2001) · Numerical Linear Algebra with Applications · doi:10.1002/nla.254 · Cited by 30
NUMERICAL SOLUTION OF DISCRETE STABLE LINEAR MATRIX EQUATIONS ON MULTICOMPUTERS
Benner, P., Quintana–Ort́ı, E. S., & Quintana‐Ortí, G. (2002) · International Journal of Parallel Emergent and Distributed Systems · doi:10.1080/10637190208941436 · Cited by 29
Low rank solution of data‐sparse Sylvester equations
Baur, U. (2008) · Numerical Linear Algebra with Applications · doi:10.1002/nla.605 · Cited by 29
Disturbance decoupling using constrained Sylvester equations
Syrmos, V. L. (1994) · IEEE Transactions on Automatic Control · doi:10.1109/9.286255 · Cited by 29
Pose estimation from multiple cameras based on Sylvester’s equation
Chen, C., & Schonfeld, D. (2010) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2010.01.002 · Cited by 28
Meerbergen, K., & Spence, A. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/080742890 · Cited by 26
Special issue on “Order reduction of large-scale systems”
Benner, P., Freund, R. W., Sorensen, D. C., & Varga, A. (2006) · Linear Algebra and its Applications · doi:10.1016/j.laa.2006.01.018 · Cited by 22
Schäfer-Bung, B., Hartmann, C., Schmidt, B., et al. (2011) · The Journal of Chemical Physics · doi:10.1063/1.3605243 · Cited by 21
Krylov Subspace Methods for Large-Scale Constrained Sylvester Equations
Shank, S. D., & Simoncini, V. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/130908804 · Cited by 14
Self-citationNumerical methods for large Lyapunov equations
Mikkelsen, C. C. K. (2009) · Purdue e-Pubs (Purdue University System) · Cited by 12
Memory-efficient Krylov subspace techniques for solving large-scale Lyapunov equations
Kreßner, D. (2008) · IEEE International Symposium on Computer-Aided Control System Design (CACSD) · doi:10.1109/cacsd.2008.4627370 · Cited by 12
The generalized Sylvester equation in polynomial matrices
Wimmer, H. K. (1996) · IEEE Transactions on Automatic Control · doi:10.1109/9.536513 · Cited by 11
Datta, B. N., & Hetti, C. (2002) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.1997.649594 · Cited by 8
The global Arnoldi process for solving the Sylvester-Observer equation
Datta, B. N., Heyouni, M., & Jbilou, K. (2010) · Computational and Applied Mathematics · doi:10.1590/s1807-03022010000300012 · Cited by 8
A Computational Method for Symmetric Stein Matrix Equations
Jbilou, K., & Messaoudi, A. (2011) · Lecture notes in electrical engineering · doi:10.1007/978-94-007-0602-6_14 · Cited by 8
Pose estimation from video sequences based on Sylvester's equation
Chen, C., Schonfeld, D., Yang, J., et al. (2007) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.702601 · Cited by 6
Cited by
Data Informativity: A New Perspective on Data-Driven Analysis and Control
van Waarde, H. J., Eising, J., Trentelman, H. L., & Camlibel, M. K. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2966717 · Cited by 514
Optimizing Neural Networks with Kronecker-factored Approximate Curvature
Martens, J., & Grosse, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.05671 · Cited by 414
A Trilateral Weighted Sparse Coding Scheme for Real-World Image Denoising
Xu, J., Zhang, L., & Zhang, D. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01237-3_2 · Cited by 278
Metadata
- Authors
- Simoncini, V.
- Venue
- SIAM Review
- Published
- 2016-01
- Volume
- 58
- Issue
- 3
- Pages
- 377-441
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2480611454
- Cited by
- 487
- References
- 91
- FWCI
- 38.41
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.