All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 20

Displaying 381 – 396 of 396

Showing per page

Approximate polynomial GCD

Eliaš, Ján, Zítko, Jan (2013)

Programs and Algorithms of Numerical Mathematics

The computation of polynomial greatest common divisor (GCD) ranks among basic algebraic problems with many applications, for example, in image processing and control theory. The problem of the GCD computing of two exact polynomials is well defined and can be solved symbolically, for example, by the oldest and commonly used Euclid’s algorithm. However, this is an ill-posed problem, particularly when some unknown noise is applied to the polynomial coefficients. Hence, new methods for the GCD computation...

Approximating real linear operators

Marko Huhtanen, Olavi Nevanlinna (2007)

Studia Mathematica

A framework to extend the singular value decomposition of a matrix to a real linear operator ℳ : ℂ ⁿ → ℂ p is suggested. To this end real linear operators called operets are introduced, to have an appropriate generalization of rank-one matrices. Then, adopting the interpretation of the singular value decomposition of a matrix as providing its nearest small rank approximations, ℳ is approximated with a sum of operets.

Approximation and asymptotics of eigenvalues of unbounded self-adjoint Jacobi matrices acting in l 2 by the use of finite submatrices

Maria Malejki (2010)

Open Mathematics

We consider the problem of approximation of eigenvalues of a self-adjoint operator J defined by a Jacobi matrix in the Hilbert space l 2(ℕ) by eigenvalues of principal finite submatrices of an infinite Jacobi matrix that defines this operator. We assume the operator J is bounded from below with compact resolvent. In our research we estimate the asymptotics (with n → ∞) of the joint error of approximation for the eigenvalues, numbered from 1 to N; of J by the eigenvalues of the finite submatrix J...

Approximation of eigenvalues for unbounded Jacobi matrices using finite submatrices

Anne Monvel, Lech Zielinski (2014)

Open Mathematics

We consider an infinite Jacobi matrix with off-diagonal entries dominated by the diagonal entries going to infinity. The corresponding self-adjoint operator J has discrete spectrum and our purpose is to present results on the approximation of eigenvalues of J by eigenvalues of its finite submatrices.

Approximations and error bounds for computing the inverse mapping

Lucas Jódar, Enrique Ponsoda, G. Rodríguez Sánchez (1997)

Applications of Mathematics

In this paper we propose a procedure to construct approximations of the inverse of a class of 𝒞 m differentiable mappings. First of all we determine in terms of the data a neighbourhood where the inverse mapping is well defined. Then it is proved that the theoretical inverse can be expressed in terms of the solution of a differential equation depending on parameters. Finally, using one-step matrix methods we construct approximate inverse mappings of a prescribed accuracy.

Aspects of non-commutative function theory

Jim Agler, John E. McCarthy (2016)

Concrete Operators

We discuss non commutative functions, which naturally arise when dealing with functions of more than one matrix variable.

Currently displaying 381 – 396 of 396

Previous Page 20