Calculating the Singular Values and Pseudo-Inverse of a Matrix

Cited in

(only showing first 100 items - show all)

Computing the complete CS decomposition
Trust-region and other regularisations of linear least-squares problems
On the estimation of a large sparse Bayesian system: the Snaer program
Vector extrapolation enhanced TSVD for linear discrete ill-posed problems
Krylov and steady-state techniques for the solution of the chemical master equation for the mitogen-activated protein kinase cascade
Approximation of multivariable linear systems with impulse response and autocorrelation sequences
Report on test matrices for generalized inverses
Solving or resolving inadequate and noisy tomographic systems
A differential equation approach to the singular value decomposition of bidiagonal matrices
An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
Bidiagonalization and diagonalization
Singular value decompositions of complex symmetric matrices
The partial total least squares algorithm
A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
Computations for constrained linear models
Simultaneous equations estimation. Computational aspects
The reduction of a general complex matrix to a condensed form by bounded single element transformations
Computational methods of linear algebra
Unidentifiable compartmental models: What to do?
Iterative solution methods for certain sparse linear systems with a non- symmetric matrix arising from PDE-problems
Quadratically constrained least squares and quadratic problems
Adaptive Lanczos methods for recursive condition estimation
Estimating the largest singular values of large sparse matrices via modified moments
Numerical algorithms for the Moore-Penrose inverse of a matrix: direct methods
Information and computation in simultaneous equations estimation
Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix
Diagonalization, rank calculation and generalized inverses of rational matrices
The effect of data grid size on certain interpolation methods for unconstrained function minimization
On the efficient and accurate solution of the skew-symmetric eigenvalue problem
Optimal combination forecasts for hierarchical time series
On the computational competitiveness of full-information maximum- likelihood and three-stage least-squares in the estimation of nonlinear, simultaneous-equations models
Parallel codes for computing the numerical rank
Concise row-pruning algorithm to invert a matrix
Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
An implicit shift bidiagonalization algorithm for ill-posed systems
A new taxonomy of conjugate gradient methods
Solution of systems of nonlinear algebraic equations in three variables. Methods and algorithms. III
An approach to solving multiparameter algebraic problems
Methods and algorithms of solving spectral problems for polynomial and rational matrices
Fitting helices to data by total least squares
Accurate ordering of eigenvectors and singular vectors without eigenvalues and singular values.
Accuracy of preconditioned CG-type methods for least squares problems.
\(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
Eigenvalue computation in the 20th century
Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
Transfer mutual information: A new method for measuring information transfer to the interactions of time series
Majorization bounds for SVD
Asymptotics for the late arrivals problem
An iterative method for computing a symplectic SVD-like decomposition
On the partial condition numbers for the indefinite least squares problem
Detection of holes in an elastic body based on eigenvalues and traces of eigenmodes
Partial condition number for the equality constrained linear least squares problem
Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
The geometric mean decomposition
A new stable bidiagonal reduction algorithm
Methods for computing weighted pseudoinverses and weighted normal pseudosolutions with singular weights
Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
A regularizing L-curve Lanczos method for underdetermined linear systems
An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD
One-sided reduction to bidiagonal form
Analysis of approximate inverses in tomography. II: Iterative inverses
Solution of sparse rectangular systems using LSQR and Craig
Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
Krylov-type methods for tensor computations.I
Reorthogonalization for the Golub-Kahan-Lanczos bidiagonal reduction
GKB-FP: An algorithm for large-scale discrete ill-posed problems
Weighted singular decomposition and weighted pseudoinversion of matrices
Estimation for matrix singular values
A direct heuristic algorithm for linear programming
Evaluation of news search engines based on information retrieval models
The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides
Structure in loss of orthogonality
Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval
The LSQR method for solving tensor least-squares problems
Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
Trace minimization method via penalty for linear response eigenvalue problems
A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
Iterative hybrid regularization for extremely noisy full models in single particle analysis
Quantum beetle swarm algorithm optimized extreme learning machine for intrusion detection
A least squares approach for saddle point problems
Representing the geometrical complexity of liners and boundaries in low-order modeling for thermoacoustic instabilities
Well-conditioned ultraspherical and spectral integration methods for resolvent analysis of channel flows of Newtonian and viscoelastic fluids
A fast regression via SVD and marginalization
Structured shifts for skew-symmetric matrices
When does the Lanczos algorithm compute exactly?
An extended block Golub-Kahan algorithm for large algebraic and differential matrix Riccati equations
A dual domain decomposition algorithm for the analysis of non-conforming isogeometric Kirchhoff-Love shells
Higher-order multifractal detrended partial cross-correlation analysis for the correlation estimator
Matrix LSQR algorithm for structured solutions to quaternionic least squares problem
Column-oriented algebraic iterative methods for nonnegative constrained least squares problems
A stabilized meshless method for time-dependent convection-dominated flow problems
Numerical inversion and uniqueness of a spherical Radon transform restricted with a fixed angular span
On a generalization of Regińska's parameter choice rule and its numerical realization in large-scale multi-parameter Tikhonov regularization
An SVD analysis of equispaced polynomial interpolation
Lanczos method for large-scale quaternion singular value decomposition
Iterative methods for solving consistent or inconsistent matrix inequality \({AXB} \geqslant C\) with linear constraints
A new iterative model updating technique based on least squares minimal residual method using measured modal data
Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
Preconditioners for rank deficient least squares problems
On Moore-Penrose pseudoinverse computation for stiffness matrices resulting from higher order approximation

This page was built for publication: Calculating the Singular Values and Pseudo-Inverse of a Matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5589678)