Accurate computations with Wronskian matrices

نویسندگان

چکیده

In this paper we provide algorithms for computing the bidiagonal decomposition of Wronskian matrices monomial basis polynomials and exponential polynomials. It is also shown that these can be used to perform accurately some algebraic computations with matrices, such as calculation their inverses, eigenvalues or singular values solutions linear systems. Numerical experiments illustrate results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accurate computations with Said-Ball-Vandermonde matrices

A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0, 1), then those matrices are strictly totally positive. An algorithm for computing the bidiagonal decomposition of those Said-Ball-Vandermonde matrices is presented, which allows to use known algorithms for totally positive mat...

متن کامل

Accurate Computations with Totally Nonnegative Matrices

Is it possible to perform numerical linear algebra with structured matrices to high relative accuracy at a reasonable cost? In our talk we answer this question affirmatively for a class of structured matrices whose applications range from approximation theory to combinatorics to multivariate statistical analysis [1, 2, 4]—the Totally Nonnegative (TN) matrices, i.e. matrices all of whose minors ...

متن کامل

Accurate computations with totally positive Bernstein-Vandermonde matrices

The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein–Vandermonde matrix is considered. Bernstein–Vandermonde matrices are a generalization of Vandermonde matrices arising when considering for the space of the algebraic polynomials o...

متن کامل

Ela Accurate Computations with Totally Positive Bernstein–vandermonde Matrices

The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein–Vandermonde matrix is considered. Bernstein–Vandermonde matrices are a generalization of Vandermonde matrices arising when considering for the space of the algebraic polynomials o...

متن کامل

Complexity of Computations with Matrices and Polynomials

We review the complexity of polynomial and matrix computations, as well as their various correlations to each other and some major techniques for the design of algebraic and numerical algorithms. Polynomial and matrix computations are highly important classical subjects. They have been thoroughly revised during the last decades due to the development of computer technology, whose latest notable...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Calcolo

سال: 2021

ISSN: ['0008-0624', '1126-5434']

DOI: https://doi.org/10.1007/s10092-020-00392-4