Accurate singular values and differential qd algorithms
From MaRDI portal
Publication:1326368
DOI10.1007/s002110050024zbMath0814.65036MaRDI QIDQ1326368
Beresford N. Parlett, K. Vince Fernando
Publication date: 18 June 1995
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050024
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65Y05: Parallel numerical computation
Related Items
Skew-Symmetric Differential qd Algorithm, A note on generating finer‐grain parallelism in a representation tree, Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance, Computation of Gauss-type quadrature formulas, Schur flow for orthogonal polynomials on the unit circle and its integrable discretization, Residual bounds for some or all singular values, Reliable root detection with the qd-algorithm: When Bernoulli, Hadamard and Rutishauser cooperate, Perturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices, Numerical performance of hyperplane constrained method and its hybrid method for singular value decomposition, A note on the dqds algorithm with Rutishauser's shift for singular values, Error analysis for matrix eigenvalue algorithm based on the discrete hungry Toda equation, Error analysis of the mdLVs algorithm for computing bidiagonal singular values, Accurate computation of singular values in terms of shifted integrable schemes, Computation of exact inertia and inclusions of eigenvalues (singular values) of tridiagonal (bidiagonal) matrices, Equality conditions for lower bounds on the smallest singular value of a bidiagonal matrix, Rigorous proof of cubic convergence for the dqds algorithm for singular values, Superquadratic convergence of DLASQ for computing matrix singular values, Implicit standard Jacobi gives high relative accuracy, Absolute and relative Weyl theorems for generalized eigenvalue problems, Sensitivity of the Lanczos recurrence to Gaussian quadrature data: how malignant can small weights be?, On the \(QR\) algorithm and updating the \(SVD\) and the \(URV\) decomposition in parallel, Rational functions, Toda flows, and LR-like algorithms, Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices, Relative perturbation theory. IV: \(\sin 2\theta\) theorems, \(QR\)-like algorithms for eigenvalue problems, For tridiagonals \(T\) replace \(T\) with \(LDL\), A new stable bidiagonal reduction algorithm, An \({\mathcal O}(n^{2})\) algorithm for the bidiagonal SVD, One-sided reduction to bidiagonal form, Accurate recovery of recursion coefficients from Gaussian quadrature formulas, Relatively robust representations of symmetric tridiagonals, An implementation of the dqds algorithm (positive case), Accurate similarity transformation derived from the discrete Lotka-Volterra system for bidiagonal singular values, A shift strategy for superquadratic convergence in the dqds algorithm for singular values, Verified bounds for all the singular values of matrix, A more accurate algorithm for computing the Christoffel transformation, Fast computation of eigenvalues of companion, comrade, and related matrices, Stability and sensitivity of tridiagonal LU factorization without pivoting, Irr: An algorithm for computing the smallest singular value of large scale matrices, An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem, Computing singular values of diagonally dominant matrices to high relative accuracy
