Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Remarks on complexity of polynomial and special matrix computations

From MaRDI portal
Publication:1824347
Jump to:navigation, search

zbMath0682.65011MaRDI QIDQ1824347

Zdeněk Vavřín

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)


zbMATH Keywords

rational interpolationToeplitz matricesmatrix inversionHankel matricespolynomial evaluationLöwner matricesasymptotic order of complexity


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation by rational functions (41A20) Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Direct numerical methods for linear systems and matrix inversion (65F05)


Related Items (2)

An inversion formula and fast algorithms for Cauchy-Vandermonde matrices ⋮ A fast Hankel solver based on an inversion formula for Loewner matrices



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Inverses of Löwner matrices
  • Hankel and Loewner matrices
  • Multiplication of diagonal transforms of Loewner matrices
  • Über monotone Matrixfunktionen
  • Fast algorithms for rational Hermite approximation and solution of Toeplitz systems


This page was built for publication: Remarks on complexity of polynomial and special matrix computations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1824347&oldid=14188863"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki