Displaying 581 – 600 of 1330

Showing per page

Inequality-based approximation of matrix eigenvectors

András Kocsor, József Dombi, Imre Bálint (2002)

International Journal of Applied Mathematics and Computer Science

A novel procedure is given here for constructing non-negative functions with zero-valued global minima coinciding with eigenvectors of a general real matrix A. Some of these functions are distinct because all their local minima are also global, offering a new way of determining eigenpairs by local optimization. Apart from describing the framework of the method, the error bounds given separately for the approximation of eigenvectors and eigenvalues provide a deeper insight into the fundamentally...

Inertias and ranks of some Hermitian matrix functions with applications

Xiang Zhang, Qing-Wen Wang, Xin Liu (2012)

Open Mathematics

Let S be a given set consisting of some Hermitian matrices with the same size. We say that a matrix A ∈ S is maximal if A − W is positive semidefinite for every matrix W ∈ S. In this paper, we consider the maximal and minimal inertias and ranks of the Hermitian matrix function f(X,Y) = P − QXQ* − TYT*, where * means the conjugate and transpose of a matrix, P = P*, Q, T are known matrices and for X and Y Hermitian solutions to the consistent matrix equations AX =B and YC = D respectively. As applications,...

Influence of preconditioning and blocking on accuracy in solving Markovian models

Beata Bylina, Jarosław Bylina (2009)

International Journal of Applied Mathematics and Computer Science

The article considers the effectiveness of various methods used to solve systems of linear equations (which emerge while modeling computer networks and systems with Markov chains) and the practical influence of the methods applied on accuracy. The paper considers some hybrids of both direct and iterative methods. Two varieties of the Gauss elimination will be considered as an example of direct methods: the LU factorization method and the WZ factorization method. The Gauss-Seidel iterative method...

Interval solutions of linear interval equations

Jiří Rohn (1990)

Aplikace matematiky

It is shown that if the concept of an interval solution to a system of linear interval equations given by Ratschek and Sauer is slightly modified, then only two nonlinear equations are to be solved to find a modified interval solution or to verify that no such solution exists.

Inverse du Laplacien discret dans le problème de Poisson-Dirichlet à deux dimensions sur un rectangle

Jean Chanzy (2006)

Annales de la faculté des sciences de Toulouse Mathématiques

Ce travail a pour objet l’étude d’une méthode de « discrétisation » du Laplacien dans le problème de Poisson à deux dimensions sur un rectangle, avec des conditions aux limites de Dirichlet. Nous approchons l’opérateur Laplacien par une matrice de Toeplitz à blocs, eux-mêmes de Toeplitz, et nous établissons une formule donnant les blocs de l’inverse de cette matrice. Nous donnons ensuite un développement asymptotique de la trace de la matrice inverse, et du déterminant de la matrice de Toeplitz....

Inverse eigenvalue problem for constructing a kind of acyclic matrices with two eigenpairs

Maryam Babaei Zarch, Seyed Abolfazl Shahzadeh Fazeli, Seyed Mehdi Karbassi (2020)

Applications of Mathematics

We investigate an inverse eigenvalue problem for constructing a special kind of acyclic matrices. The problem involves the reconstruction of the matrices whose graph is an m -centipede. This is done by using the ( 2 m - 1 ) st and ( 2 m ) th eigenpairs of their leading principal submatrices. To solve this problem, the recurrence relations between leading principal submatrices are used.

Currently displaying 581 – 600 of 1330