scientific article; zbMATH DE number 691245

Publication date: 21 November 1994

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

interpolation computational complexity textbook symbolic computation fast Fourier transform polynomials power series analysis of algorithms parallel computations exercises numerical computing algebraic computation dense structured matrices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical interpolation (65D05) Computation of special functions and constants, construction of tables (65D20) Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical linear algebra (65Fxx)

Related Items

A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial, Improved parallel solution of a triangular linear system, A note on computing the inverse of a triangular Toeplitz matrix, Solving composite sum of powers via Padé approximation and orthogonal polynomials with application to optimal PWM problem, Fast computation of discrete invariants associated to a differential rational mapping, On a class of matrix pencils and $\ell$-ifications equivalent to a given matrix polynomial, Computing the exponential of large block-triangular block-Toeplitz matrices encountered in fluid queues, Bezout matrices, subresultant polynomials and parameters, Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits, Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile, Computations with infinite Toeplitz matrices and polynomials, Fast direct solution methods for symmetric banded Toeplitz systems, based on the sine transform, Structured matrices and Newton's iteration: unified approach, An algebraic approach to approximate evaluation of a polynomial on a set of real points, Parallel computation of a Krylov matrix for a sparse and structured input, New studies of randomized augmentation and additive preprocessing, Newton's iteration for inversion of Cauchy-like and other structured matrices, Displacement-structure approach to polynomial Vandermonde and related matrices, Computing curve intersection by means of simultaneous iterations, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Algebraic and numerical techniques for the computation of matrix determinants, New PCG based algorithms for the solution of Hermitian Toeplitz systems, Matrix structure and loss-resilient encoding/decoding, Matrix displacement decompositions and applications to Toeplitz linear systems, Bernstein-Bézoutian matrices, Polynomial equation solving by lifting procedures for ramified fibers, Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile, Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate, Iterative inversion of structured matrices, Factorizations of Cauchy matrices, Inverting block Toeplitz matrices in block Hessenberg form by means of displacement operators: Application to queueing problems, Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation, A stabilized superfast solver for indefinite Hankel systems, A fast block Hankel solver based on an inversion formula for block Loewner matrices, Techniques for exploiting structure in matrix formulae of the sparse resultant, Multidimensional structured matrices and polynomial systems, New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set, Bernstein-Bezoutian matrices and curve implicitization, Asymptotically fast solution of two-level banded Toeplitz systems of linear equations, Parallel algorithms for certain matrix computations, Matrix computations and polynomial root-finding with preprocessing, Nearly optimal refinement of real roots of a univariate polynomial, Efficient polynomial root-refiners: a survey and new record efficiency estimates, A geometric algorithm for winding number computation with complexity analysis, Bernstein Bézoutians and application to intersection problems, Dynamic normal forms and dynamic characteristic polynomial, A relaxation scheme for increasing the parallelism in Jacobi-SVD, A subdivision method for computing nearest gcd with certification, Finding strong bridges and strong articulation points in linear time, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Solving linear systems of equations with randomization, augmentation and aggregation, Generalized fraction-free $LU$ factorization for singular systems with kernel extraction, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, A heuristic verification of the degree of the approximate GCD of two univariate polynomials, Transformations of matrix structures work again, Inverse power and Durand-Kerner iterations for univariate polynomial root-finding, Non-skip-free M/G/1-type Markov chains and Laurent matrix power series, The complexity of computing all subfields of an algebraic number field, Optimal Karatsuba-like formulae for certain bilinear forms in GF(2), Degeneration of structured integer matrices modulo an integer, Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations, Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems, Solving structured linear systems with large displacement rank, $h$-adic polynomials and partial fraction decomposition of proper rational functions over $\mathbb{R}$ or $\mathbb{C}$, Fast computation of determinants of Bézout matrices and application to curve implicitization, On the kernel structure of generalized resultant matrices, Various new expressions for subresultants and their applications, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, On solving univariate sparse polynomials in logarithmic time, Computing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration, Computing the block factorization of complex Hankel matrices, An efficient solution for Cauchy-like systems of linear 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, A family of modified regularizing circulant preconditioners for two-levels Toeplitz systems, On sign conditions over real multivariate polynomials, Tensor ranks for the inversion of tensor-product binomials, Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem, An application of matrix computations to classical second-order optimality conditions, The Sylvester and Bézout resultant matrices for blind image deconvolution, A computational study of ruled surfaces, An algorithm for implicit interpolation, Matrices in elimination theory, Solving degenerate sparse polynomial systems faster, A fast Hankel solver based on an inversion formula for Loewner matrices, Fast rectangular matrix multiplication and applications, Sign determination in residue number systems, Deformation techniques for sparse systems, Matrix inversion cases with size-independent tensor rank estimates, A new efficient algorithm for computing Gröbner bases $(F_4)$, Finding the radical of matrix algebras using Fitting decompositions, Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication, Load-balanced parallel banded-system solvers., Computation of approximate polynomial GCDs and an extension, Condition number bounds for problems with integer coefficients, Predicting zero coefficients in formal power series computations., Symbolic and numeric methods for exploiting structure in constructing resultant matrices, Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices, New transformations of Cauchy matrices and Trummer's problem, Numerically safe Gaussian elimination with no pivoting, Treating the Exceptional Cases of the MeatAxe, More on solving systems of power equations, Lifting and recombination techniques for absolute factorization, Batched Point Location in SINR Diagrams via Algebraic Tools, Computations with quasiseparable polynomials and matrices, Schur aggregation for linear systems and determinants, A new Gröbner basis conversion method based on stabilization techniques, Matrix decompositions using displacement rank and classes of commutative matrix algebras, The amended DSeSC power method for polynomial root-finding, Polynomial evaluation and interpolation on special sets of points, Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, A fast, preconditioned conjugate gradient Toeplitz and Toeplitz-like solvers, Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant, Parallel computation of determinants of matrices with polynomial entries, Algebras of higher dimension for displacement decompositions and computations with Toeplitz plus Hankel matrices, Nonuniform ACC Circuit Lower Bounds, Computing Riemann-Roch spaces via Puiseux expansions, An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem, A new complexity bound for the least-squares problem, Optimal and nearly optimal algorithms for approximating polynomial zeros, Time and space efficient generators for quasiseparable matrices, On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms, Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox, Orthogonal Cauchy-like matrices, Elimination ideal and bivariate resultant over finite fields, Fast systematic encoding of multiplicity codes, Improved bisection eigenvalue method for band symmetric Toeplitz matrices, Vector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial Approach, Symbolic computations of first integrals for polynomial vector fields, Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields, Fast algorithms for Toeplitz and Hankel matrices, Superfast solution of Toeplitz systems based on syzygy reduction, Resultant matrices and inversion of Bézoutians, Fast matrix multiplication and its algebraic neighbourhood, Polynomial root finding over local rings and application to error correcting codes, Fast multidimensional Bernstein-Lagrange algorithms, Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values, Computing the polynomial remainder sequence via Bézout matrices, Geometric means of structured matrices, Inversion of circulant matrices over $\mathbf{Z}_m$, Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields, Rational interpolation and recursive solution of Löwner-Vandermonde systems of equations, New techniques for the computation of linear recurrence coefficients, On the inversion of the block double-structured and of the triple-structured Toeplitz matrices and on the corresponding reflection coefficients, Fast computation of special resultants, Multivariate polynomials, duality, and structured matrices, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Lifting/descending processes for polynomial zeros., Superfast algorithms for Cauchy-like matrix computations and extensions, Matrices in companion rings, Smith forms, and the homology of 3-dimensional Brieskorn manifolds, Recursive algorithms for unbalanced banded Toeplitz systems, Symmetric subresultants and applications, Verification protocols with sub-linear communication for polynomial matrix operations, Elimination for generic sparse polynomial systems, Blind image deconvolution via Hankel based method for computing the GCD of polynomials, A fast method to block-diagonalize a Hankel matrix, On solving composite power polynomial equations, General polynomial roots and their multiplicities inO(N)memory andO(N²)Time^∗, Structured low rank decomposition of multivariate Hankel matrices, A fast algorithm for solving banded Toeplitz systems, A Gröbner free alternative for polynomial system solving, Polynomials arising in factoring generalized Vandermonde determinants: An algorithm for computing their coefficients, On the complexity of the resolvent representation of some prime differential ideals, On the geometry of Graeffe iteration, Solving matrix polynomial equations arising in queueing problems, Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields, A gradient system approach for Hankel structured low-rank approximation, Method for finding multiple roots of polynomials, Finite type projective modules, crossed linear maps and generalized inverses. (Modules projectifs de type fini, applications linéaires croisées et inverses généralisés), Fast Hermite interpolation and evaluation over finite fields of characteristic two, A fast iterative method for determining the stability of a polynomial, A note on the $O(n)$-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices, Scalable public-key tracing and revoking, Algebras closed by $J$-Hermitianity in displacement formulas, Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers, Computer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zeros, Nearly optimal computations with structured matrices, High order singular value decomposition for plant diversity estimation, All secant varieties of the Chow variety are nondefective for cubics and quaternary forms, On the structure of the inverse to Toeplitz-block Toeplitz matrices and of the corresponding polynomial reflection coefficients, A recombination algorithm for the decomposition of multivariate rational functions, Computing Puiseux series: a fast divide and conquer algorithm, Computationally efficient applications of the Euclidean algorithm to zero location, More on Electrostatic Models for Zeros of Orthagonal Polynomials, Fast computation of a rational point of a variety over a finite field, Block diagonalization and LU-equivalence of Hankel matrices, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions, Resolution of the finite Markov moment problem, Korovkin tests, approximation, and ergodic theory, Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case, Subresultant chains using Bézout matrices, Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation, Real polynomial root-finding by means of matrix and polynomial iterations, Accelerated approximation of the complex roots and factors of a univariate polynomial