scientific article

Publication date: 17 December 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

algorithms bibliography textbook rational interpolation polynomials computer algebra decoding numerical linear algebra encoding exercises Newton's iteration structured matrices divide-and-conquer method displacement rank Nevanlinna-Pick problem Nehari problems recursive matrix factorization symbolic operator approach

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (only showing first 100 items - show all)

Numerically safe Gaussian elimination with no pivoting ⋮ The stability of formulae of the Gohberg-Semencul-Trench type for Moore-Penrose and group inverses of Toeplitz matrices ⋮ A note on computing the inverse of a triangular Toeplitz matrix ⋮ Displacement rank of the Drazin inverse ⋮ Efficient Identification of Butterfly Sparse Matrix Factorizations ⋮ Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets ⋮ Fast sixth-order algorithm based on the generalized Cayley transform for the Zakharov-Shabat system associated with nonlinear Schrödinger equation ⋮ Accurate solutions of product linear systems associated with rank-structured matrices ⋮ A fast direct method for block triangular Toeplitz-like with tri-diagonal block systems from time-fractional partial differential equations ⋮ Computations with quasiseparable polynomials and matrices ⋮ Schur aggregation for linear systems and determinants ⋮ Structured matrices and Newton's iteration: unified approach ⋮ Additive preconditioning for matrix computations ⋮ Generalizing block LU factorization: a lower-upper-lower block triangular decomposition with minimal off-diagonal ranks ⋮ Unnamed Item ⋮ The amended DSeSC power method for polynomial root-finding ⋮ New studies of randomized augmentation and additive preprocessing ⋮ A periodic qd-type reduction for computing eigenvalues of structured matrix products to high relative accuracy ⋮ Displacement structure of the core inverse ⋮ Multi-dimensional Capon spectral estimation using discrete Zhang neural networks ⋮ Matrix structure and loss-resilient encoding/decoding ⋮ Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile ⋮ Iterative inversion of structured matrices ⋮ An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem ⋮ The Schur aggregation and solving ill conditioned linear systems: the convergence theorem ⋮ Random Toeplitz matrices: The condition number under high stochastic dependence ⋮ Infinite triangular matrices, \(q\)-Pascal matrices, and determinantal representations ⋮ Memoryless block transceivers with minimum redundancy based on Hartley transforms ⋮ The fast Slepian transform ⋮ Wiener-Hopf and spectral factorization of real polynomials by Newton's method ⋮ On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms ⋮ Additive Preconditioning for Matrix Computations ⋮ Automating algorithm selection: checking for matrix properties that can simplify computations ⋮ Fast systematic encoding of multiplicity codes ⋮ Matrix computations and polynomial root-finding with preprocessing ⋮ Nearly optimal refinement of real roots of a univariate polynomial ⋮ Randomized preprocessing versus pivoting ⋮ Additive preconditioning and aggregation in matrix computations ⋮ Modified SMS method for computing outer inverses of Toeplitz matrices ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ Fast algorithms for Toeplitz and Hankel matrices ⋮ Fast recovery and approximation of hidden Cauchy structure ⋮ Superfast solution of Toeplitz systems based on syzygy reduction ⋮ Matrix completion for matrices with low-rank displacement ⋮ Fast structured matrix computations: tensor rank and Cohn-Umans method ⋮ Resultant matrices and inversion of Bézoutians ⋮ Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Hardware-friendly compression and hardware acceleration for transformer: a survey ⋮ Solving linear systems of equations with randomization, augmentation and aggregation ⋮ Transformations of matrix structures work again ⋮ An improved computationally efficient method for finding the Drazin inverse ⋮ Root-squaring with DPR1 matrices ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ Derivation and Analysis of Fast Bilinear Algorithms for Convolution ⋮ Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization ⋮ Root-finding by expansion with independent constraints ⋮ The generalized reciprocal super Catalan matrix ⋮ Trapdoor delegation and HIBE from middle-product LWE in standard model ⋮ The reciprocal super Catalan matrix ⋮ A variant of the reciprocal super Catalan matrix ⋮ Toeplitz matrices for LTI systems, an illustration of their application to Wiener filters and estimators ⋮ Degeneration of structured integer matrices modulo an integer ⋮ Homotopic residual correction processes ⋮ An efficient method to compute the Moore-Penrose inverse ⋮ Solving structured linear systems with large displacement rank ⋮ A nearly optimal algorithm to decompose binary forms ⋮ Fast computation of determinants of Bézout matrices and application to curve implicitization ⋮ The spectral connection matrix for classical orthogonal polynomials of a single parameter ⋮ A fast method to block-diagonalize a Hankel matrix ⋮ Optimal Designs for Rational Function Regression ⋮ On the kernel structure of generalized resultant matrices ⋮ Approximate factorization of multivariate polynomials using singular value decomposition ⋮ Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding ⋮ Displacement structure of \(W\)-weighted Drazin inverse \(A_{d,W}\) and its perturbation ⋮ Improved algorithms for computing determinants and resultants ⋮ Fast approximate inversion of a block triangular Toeplitz matrix with applications to fractional sub‐diffusion equations ⋮ Randomized preprocessing of homogeneous linear systems of equations ⋮ Newton-like iteration based on a cubic polynomial for structured matrices ⋮ New progress in real and complex polynomial root-finding ⋮ On the complexities of multipoint evaluation and interpolation ⋮ An Algorithm for Transforming Regular Chain into Normal Chain ⋮ Fast Hermite interpolation and evaluation over finite fields of characteristic two ⋮ Estimating the norms of random circulant and Toeplitz matrices and their inverses ⋮ Backward error analysis of the extended iterative refinement or improvement algorithm for solving ill conditioned linear system ⋮ New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration ⋮ How Bad Are Vandermonde Matrices? ⋮ Nearly optimal computations with structured matrices ⋮ A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy ⋮ Jet functions having indefinite Carathéodory-Pick matrices ⋮ Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy ⋮ Fast conversion algorithms for orthogonal polynomials ⋮ The asymptotic distribution of the condition number for random circulant matrices ⋮ Computation of approximate polynomial GCDs and an extension ⋮ Symbolic and numeric methods for exploiting structure in constructing resultant matrices ⋮ Accurate Computation of Generalized Eigenvalues of Regular SR-BP Pairs ⋮ Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation ⋮ Inverting Structured Operators Related to Toeplitz Plus Hankel Operators ⋮ Fast approximate computations with Cauchy matrices and polynomials ⋮ Real polynomial root-finding by means of matrix and polynomial iterations

This page was built for publication: