The following pages link to (Q2760974):
Displaying 50 items.
- The stability of formulae of the Gohberg-Semencul-Trench type for Moore-Penrose and group inverses of Toeplitz matrices (Q269264) (← links)
- A note on computing the inverse of a triangular Toeplitz matrix (Q273349) (← links)
- Generalizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranks (Q314752) (← links)
- New studies of randomized augmentation and additive preprocessing (Q332656) (← links)
- The Schur aggregation and solving ill conditioned linear systems: the convergence theorem (Q384796) (← links)
- Wiener-Hopf and spectral factorization of real polynomials by Newton's method (Q393389) (← links)
- Modified SMS method for computing outer inverses of Toeplitz matrices (Q426313) (← links)
- Solving linear systems of equations with randomization, augmentation and aggregation (Q454828) (← links)
- Transformations of matrix structures work again (Q471925) (← links)
- The reciprocal super Catalan matrix (Q491779) (← links)
- A variant of the reciprocal super Catalan matrix (Q491787) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Matrix structure and loss-resilient encoding/decoding (Q597244) (← links)
- Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile (Q598217) (← links)
- Iterative inversion of structured matrices (Q598225) (← links)
- Infinite triangular matrices, \(q\)-Pascal matrices, and determinantal representations (Q609506) (← links)
- Memoryless block transceivers with minimum redundancy based on Hartley transforms (Q612584) (← links)
- Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- On the kernel structure of generalized resultant matrices (Q692591) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- Additive preconditioning for matrix computations (Q846341) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Fast recovery and approximation of hidden Cauchy structure (Q905717) (← links)
- Degeneration of structured integer matrices modulo an integer (Q947675) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Fast computation of determinants of Bézout matrices and application to curve implicitization (Q957991) (← links)
- Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
- New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration (Q1005809) (← links)
- Fast conversion algorithms for orthogonal polynomials (Q1044602) (← links)
- Structured matrices and Newton's iteration: unified approach (Q1348095) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Accurate solutions of product linear systems associated with rank-structured matrices (Q1631422) (← links)
- A periodic qd-type reduction for computing eigenvalues of structured matrix products to high relative accuracy (Q1651311) (← links)
- Fast structured matrix computations: tensor rank and Cohn-Umans method (Q1704813) (← links)
- An improved computationally efficient method for finding the Drazin inverse (Q1727190) (← links)
- An efficient method to compute the Moore-Penrose inverse (Q1747875) (← links)
- Displacement structure of \(W\)-weighted Drazin inverse \(A_{d,W}\) and its perturbation (Q1763288) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Newton-like iteration based on a cubic polynomial for structured matrices (Q1768394) (← links)
- Jet functions having indefinite Carathéodory-Pick matrices (Q1827507) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Displacement rank of the Drazin inverse (Q1877130) (← links)
- Randomized preprocessing versus pivoting (Q1940337) (← links)
- Superfast solution of Toeplitz systems based on syzygy reduction (Q1947118) (← links)
- A nearly optimal algorithm to decompose binary forms (Q1994885) (← links)
- Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy (Q2074903) (← links)
- The asymptotic distribution of the condition number for random circulant matrices (Q2093404) (← links)
