Calculating the Singular Values and Pseudo-Inverse of a Matrix
From MaRDI portal
Publication:5589678
DOI10.1137/0702016zbMath0194.18201OpenAlexW2005423095WikidataQ56135294 ScholiaQ56135294MaRDI QIDQ5589678
Publication date: 1965
Published in: Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9238de967f7bd30d5fb5b2a9450e42023add7910
Related Items (only showing first 100 items - show all)
The joint bidiagonalization process with partial reorthogonalization ⋮ Complex systems: features, similarity and connectivity ⋮ A differential equation approach to the singular value decomposition of bidiagonal matrices ⋮ Transfer mutual information: A new method for measuring information transfer to the interactions of time series ⋮ Decomposition of a planar vector field into irrotational and rotational components ⋮ Majorization bounds for SVD ⋮ Pricing exotic derivatives exploiting structure ⋮ An implicit shift bidiagonalization algorithm for ill-posed systems ⋮ 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 ⋮ Inheritance of the discrete Picard condition in Krylov subspace methods ⋮ A new taxonomy of conjugate gradient methods ⋮ Accelerating large partial EVD/SVD calculations by filtered block Davidson methods ⋮ Quaternion singular value decomposition based on bidiagonalization to a real or complex matrix using quaternion Householder transformations ⋮ A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations ⋮ A matching pursuit approach to solenoidal filtering of three-dimensional velocity measurements ⋮ Some simple estimates for singular values of a matrix ⋮ Lanczos tridiagonalization and core problems ⋮ Computation of exact inertia and inclusions of eigenvalues (singular values) of tridiagonal (bidiagonal) matrices ⋮ Matrix iterative solutions to the least squares problem of \(BXA^{T} = F\) with some linear constraints ⋮ Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration ⋮ Solution of systems of nonlinear algebraic equations in three variables. Methods and algorithms. III ⋮ An approach to solving multiparameter algebraic problems ⋮ Rules and software for detecting rank degeneracy ⋮ A unitary similarity transform of a normal matrix to complex symmetric form ⋮ Simple backward error bounds for linear least-squares problems ⋮ Methods and algorithms of solving spectral problems for polynomial and rational matrices ⋮ Fitting helices to data by total least squares ⋮ Complex wedge-shaped matrices: a generalization of Jacobi matrices ⋮ Computations for constrained linear models ⋮ Two projection methods for regularized total least squares approximation ⋮ Simultaneous equations estimation. Computational aspects ⋮ The reduction of a general complex matrix to a condensed form by bounded single element transformations ⋮ A Krylov-Schur approach to the truncated SVD ⋮ \(\mathcal H\)-matrix accelerated second moment analysis for potentials with rough correlation ⋮ Computational methods of linear algebra ⋮ A new iterative method for solving linear Fredholm integral equations using the least squares method ⋮ Dimensional reduction in vector space methods for natural language processing: products and projections ⋮ Unidentifiable compartmental models: What to do? ⋮ Least-squares approximations in geometric buildup for solving distance geometry problems ⋮ Accurate ordering of eigenvectors and singular vectors without eigenvalues and singular values. ⋮ Iterative solution methods for certain sparse linear systems with a non- symmetric matrix arising from PDE-problems ⋮ A note on inclusion intervals of matrix singular values ⋮ Accuracy of preconditioned CG-type methods for least squares problems. ⋮ The singular values and vectors of low rank perturbations of large rectangular random matrices ⋮ Personal report : Gene Howard Golub, 1932--2007 ⋮ Efficient GOCE satellite gravity field recovery based on least-squares using QR decomposition ⋮ Fast ESPRIT algorithms based on partial singular value decompositions ⋮ 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 ⋮ Adaptability, interpretability and rule weights in fuzzy rule-based systems ⋮ Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. I. positive definite weights ⋮ Computing projections with LSQR ⋮ Iterative algorithms for least-squares solutions of a quaternion matrix equation ⋮ Partial least-squares vs. Lanczos bidiagonalization. I: Analysis of a projection method for multiple regression ⋮ New inclusion sets for singular values ⋮ Partitioning strategies for the block Cimmino algorithm ⋮ LSQR iterative method for generalized coupled Sylvester matrix equations ⋮ Updating the regularization parameter in the adaptive cubic regularization algorithm ⋮ Algorithm Q-LSQR for the least squares problem in quaternionic quantum theory ⋮ Implicitly-weighted total least squares ⋮ On tridiagonal matrices unitarily equivalent to normal matrices ⋮ The ERES method for computing the approximate GCD of several polynomials ⋮ A QR-method for computing the singular values via semiseparable matrices ⋮ LSQR iterative common symmetric solutions to matrix equations \(AXB = E\) and \(CXD = F\) ⋮ New matrix iterative methods for constraint solutions of the matrix equation \(AXB=C\) ⋮ Optimal combination forecasts for hierarchical time series ⋮ 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 ⋮ Using semiseparable matrices to compute the SVD of a general matrix product/quotient ⋮ Inverse analysis FOR two-dimensional structures using the boundary element method ⋮ Meshless thin plate spline methods for the modified Helmholtz equation ⋮ Identification of discontinuous nonlinear systems via a multivariate Padé approach ⋮ Approximating the leading singular triplets of a large matrix function ⋮ 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 ⋮ Matrix-free Krylov iteration for implicit convolution of numerically low-rank data ⋮ A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices ⋮ On the computational competitiveness of full-information maximum- likelihood and three-stage least-squares in the estimation of nonlinear, simultaneous-equations models ⋮ On the transition of genetic differentiation from isolation to panmixia: what we can learn from \(G_{ST}\) and \(D\) ⋮ 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 ⋮ A note on the computation of the generalized cross-validation function for ill-conditioned least squares problems ⋮ 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 ⋮ \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation. ⋮ Approximation of multivariable linear systems with impulse response and autocorrelation sequences ⋮ Eigenvalue computation in the 20th century ⋮ Parallel codes for computing the numerical rank ⋮ Report on test matrices for generalized inverses ⋮ Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian ⋮ Concise row-pruning algorithm to invert a matrix ⋮ Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation ⋮ Solving or resolving inadequate and noisy tomographic systems
This page was built for publication: Calculating the Singular Values and Pseudo-Inverse of a Matrix
