Pages that link to "Item:Q1218717"
From MaRDI portal
The following pages link to Error analysis of QR decompositions by Givens transformations (Q1218717):
Displaying 20 items.
- Error analysis of an algorithm for solving an undetermined linear system (Q796245) (← links)
- On the error estimate for the projection of a point onto a linear manifold (Q917221) (← links)
- Implicit standard Jacobi gives high relative accuracy (Q1034687) (← links)
- Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems (Q1070768) (← links)
- A pipelined Givens method for computing the QR factorization of a sparse matrix (Q1072333) (← links)
- A direct method for completing eigenproblem solutions on a parallel computer (Q1072341) (← links)
- Linear algebra on high performance computers (Q1093318) (← links)
- Hybrid algorithm for fast Toeplitz orthogonalization (Q1094090) (← links)
- Error analysis of algorithms for computing the projection of a point onto a linear manifold (Q1094093) (← links)
- A survey of the advances in the exploitation of the sparsity in the solution of large problems (Q1099926) (← links)
- Comparison of two pivotal strategies in sparse plane rotations (Q1164377) (← links)
- Error analysis of null space algorithm for linear equality constrained least squares problems (Q1319046) (← links)
- Multivariate \(\theta\)-generalized normal distributions (Q1393913) (← links)
- A fast algorithm for index of annihilation computations (Q1807796) (← links)
- Stability analysis of the method of seminormal equations for linear least squares problems (Q1821506) (← links)
- An alternative Givens ordering (Q1836269) (← links)
- Asymptotic normality of multivariate trimmed means (Q1907888) (← links)
- Rounding-error and perturbation bounds for the indefinite QR factorization (Q1976912) (← links)
- Performing armchair roundoff analyses of statistical algorithms (Q4170053) (← links)
- An optimal, stable continued fraction algorithm for arbitrary dimension (Q4645911) (← links)
