Pages that link to "Item:Q1964330"
From MaRDI portal
The following pages link to Computing the singular value decomposition with high relative accuracy (Q1964330):
Displaying 24 items.
- Accurate and fast computations with positive extended Schoenmakers-Coffey matrices (Q2955997) (← links)
- Matrices with Hierarchical Low-Rank Structures (Q2971626) (← links)
- Computing singular values of diagonally dominant matrices to high relative accuracy (Q3055066) (← links)
- Vector Fitting for Matrix-valued Rational Approximation (Q3447463) (← links)
- Pinchings and Norms of Scaled Triangular Matrices (Q4542165) (← links)
- The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale (Q4554900) (← links)
- A Matrix Approach to the Newton Formula and Divided Differences (Q4555553) (← links)
- Total Positivity: A New Inequality and Related Classes of Matrices (Q4555568) (← links)
- Accurate inverses for computing eigenvalues of extremely ill-conditioned matrices and differential operators (Q4586618) (← links)
- Accurate Computations and Applications of Some Classes of Matrices (Q4637193) (← links)
- (Q5004388) (← links)
- Accurate Computation of Generalized Eigenvalues of Regular SR-BP Pairs (Q5021022) (← links)
- Combinatorial preconditioning for accelerating the convergence of the parallel block Jacobi method for the symmetric eigenvalue problem (Q5047092) (← links)
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy (Q5235098) (← links)
- Data Driven Koopman Spectral Analysis in Vandermonde--Cauchy Form via the DFT: Numerical Method and Theoretical Insights (Q5240804) (← links)
- Relative Perturbation Analysis for Eigenvalues and Singular Values of Totally Nonpositive Matrices (Q5254388) (← links)
- Accurate Computations with Collocation Matrices of q-Bernstein Polynomials (Q5264999) (← links)
- Algorithm 960 (Q5270755) (← links)
- Subtraction-free complexity, cluster transformations, and spanning trees (Q5963078) (← links)
- Polynomial total positivity and high relative accuracy through Schur polynomials (Q6053015) (← links)
- On the accuracy of de Casteljau-type algorithms and Bernstein representations (Q6080373) (← links)
- A Newton method for best uniform rational approximation (Q6109898) (← links)
- High relative accuracy through Newton bases (Q6140897) (← links)
- Accurate and fast computations with Green matrices (Q6170087) (← links)