Iterative Solution of Symmetric Quasi-Definite Linear Systems
From MaRDI portal
Publication:2985093
DOI10.1137/1.9781611974737zbMath1409.65004OpenAlexW2609118327MaRDI QIDQ2985093
Publication date: 16 May 2017
Full work available at URL: https://doi.org/10.1137/1.9781611974737
iterative methodsKrylov subspacesLSQRLanczos processlinear least squares problemsLSMRCRAIGGolub-Kahan processsymmetric quasi definite matrices
Theory of programming languages (68N15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical linear algebra (65Fxx)
Related Items
A regularized interior-point method for constrained linear least squares, GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems, A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows, Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix, Weighted tensor Golub-Kahan-Tikhonov-type methods applied to image processing using a t-product, Estimating shape parameters of piecewise linear-quadratic problems, Harmonic vibration analysis with coherent‐nodal‐cluster two‐stage model reduction, A regularization method for constrained nonlinear least squares, Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems, Efficient generalized Golub–Kahan based methods for dynamic inverse problems, Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization, A Regularized Factorization-Free Method for Equality-Constrained Optimization, Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization, Efficient semidefinite programming with approximate ADMM, LNLQ: An Iterative Method for Least-Norm Problems with an Error Minimization Property, A Tridiagonalization Method for Symmetric Saddle-Point Systems, Euclidean-Norm Error Bounds for SYMMLQ and CG, LSLQ: An Iterative Method for Linear Least-Squares with an Error Minimization Property, Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices, <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems
Uses Software
