On Computations with Dense Structured Matrices
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 4120318 (Why is no real title available?)
- scientific article; zbMATH DE number 3338102 (Why is no real title available?)
- A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors
- A Fast Algorithm for the Numerical Evaluation of Conformal Mappings
- A fast algorithm for the discrete Laplace transformation
- A method of local corrections for computing the velocity field due to a distribution of vortex blobs
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Displacement ranks of matrices and linear equations
- Divide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
- Efficient solution of linear systems of equations with recursive structure
- Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function
- Fast Parallel Algorithms for QR and Triangular Factorization
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- Linear complexity parallel algorithms for linear systems of equations with recursive structure
- Rapid solution of integral equations of classical potential theory
- Superfast Solution of Real Positive Definite Toeplitz Systems
- Vortex methods for flow simulation
Cited in
(42)- Fast algorithms of Björck-Pereyra type for solving Cauchy-Vandermonde linear systems
- Schur aggregation for linear systems and determinants
- Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Additive preconditioning and aggregation in matrix computations
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- Localized radial basis functions-based pseudo-spectral method (LRBF-PSM) for nonlocal diffusion problems
- Unified nearly optimal algorithms for structured integer matrices
- Displacement structure approach to discrete-trigonometric-transform based preconditioners of G. Strang type and of T. Chan type
- Product rules for the displacement of near-Toeplitz matrices
- How bad are Vandermonde matrices?
- scientific article; zbMATH DE number 5674690 (Why is no real title available?)
- Efficient parallel factorization and solution of structured and unstructured linear systems
- Fast matrix multiplication and its algebraic neighbourhood
- Numerical simulations of nonlocal phase-field and hyperbolic nonlocal phase-field models via localized radial basis functions-based pseudo-spectral method (LRBF-PSM)
- Displacement structure approach to Chebyshev-Vandermonde and related matrices
- Improved parallel computations with Toeplitz-like and Hankel-like matrices
- Efficient matrix preconditioners for black box linear algebra
- New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration
- Fast computation of determinants of Bézout matrices and application to curve implicitization
- Numerically safe Gaussian elimination with no pivoting
- Structured matrices and Newton's iteration: unified approach
- Parallel solution of Toeplitzlike linear systems
- On matrices with displacement structure: generalized operators and faster algorithms
- scientific article; zbMATH DE number 1445400 (Why is no real title available?)
- Newton's iteration for inversion of Cauchy-like and other structured matrices
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
- Solving linear systems of equations with randomization, augmentation and aggregation
- scientific article; zbMATH DE number 1505545 (Why is no real title available?)
- An inversion formula and fast algorithms for Cauchy-Vandermonde matrices
- Homotopic residual correction processes
- Fast approximate computations with Cauchy matrices and polynomials
- Superfast algorithms for Cauchy-like matrix computations and extensions
- Randomized preprocessing of homogeneous linear systems of equations
- Time and space efficient generators for quasiseparable matrices
- Nearly optimal computations with structured matrices
- A new approach to fast polynomial interpolation and multipoint evaluation
- Randomized preprocessing versus pivoting
- Solving structured linear systems with large displacement rank
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems
- Computing with locally effective matrices
This page was built for publication: On Computations with Dense Structured Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3482396)
