scholarly journals A WAY TO GENERATE SINGULAR MATRIX

2020 ◽  
Vol 9 (7) ◽  
pp. 4329-4344
Author(s):  
M. Miteva ◽  
L. K. Lazarova ◽  
N. Stojkovik ◽  
A. Stojanova
Keyword(s):  
Singular Matrix

scholarly journals Rational Krylov methods for fractional diffusion problems on graphs

2021 ◽  
Author(s):  
Michele Benzi ◽  
Igor Simunec
Keyword(s):  
Analytic Function ◽  
Diffusion Equation ◽  
Graph Laplacian ◽  
Fractional Diffusion ◽  
Singular Matrix ◽  
Krylov Methods ◽  
Fractional Powers ◽  
Directed Networks ◽  
Rank One ◽  
Diffusion Problems

AbstractIn this paper we propose a method to compute the solution to the fractional diffusion equation on directed networks, which can be expressed in terms of the graph Laplacian L as a product $$f(L^T) \varvec{b}$$ f ( L T ) b , where f is a non-analytic function involving fractional powers and $$\varvec{b}$$ b is a given vector. The graph Laplacian is a singular matrix, causing Krylov methods for $$f(L^T) \varvec{b}$$ f ( L T ) b to converge more slowly. In order to overcome this difficulty and achieve faster convergence, we use rational Krylov methods applied to a desingularized version of the graph Laplacian, obtained with either a rank-one shift or a projection on a subspace.

The semigroup generated by a unitary orbit of a singular matrix

2007 ◽  
Vol 55 (5) ◽  
pp. 417-428 ◽  
Author(s):  
H. Radjavi ◽  
A. R. Sourour
Keyword(s):  
Singular Matrix ◽  
Unitary Orbit

scholarly journals A necessary and sufficient condition for simultaneous diagonalization of two hermitian matrices and its application

1970 ◽  
Vol 11 (1) ◽  
pp. 81-83 ◽  
Author(s):  
Yik-Hoi Au-Yeung
Keyword(s):  
Complex Numbers ◽  
Single Element ◽  
Singular Matrix ◽  
Necessary And Sufficient Condition ◽  
Simultaneous Diagonalization ◽  
Hermitian Matrices ◽  
Skew Field ◽  
Conjugate Transpose ◽  
Necessary And Sufficient ◽  
Real Quaternions

We denote by F the field R of real numbers, the field C of complex numbers, or the skew field H of real quaternions, and by Fn an n dimensional left vector space over F. If A is a matrix with elements in F, we denote by A* its conjugate transpose. In all three cases of F, an n × n matrix A is said to be hermitian if A = A*, and we say that two n × n hermitian matrices A and B with elements in F can be diagonalized simultaneously if there exists a non singular matrix U with elements in F such that UAU* and UBU* are diagonal matrices. We shall regard a vector u ∈ Fn as a l × n matrix and identify a 1 × 1 matrix with its single element, and we shall denote by diag {A1, …, Am} a diagonal block matrix with the square matrices A1, …, Am lying on its diagonal.

scholarly journals A generalized inverse for matrices

1955 ◽  
Vol 51 (3) ◽  
pp. 406-413 ◽  
Author(s):  
R. Penrose
Keyword(s):  
Unique Solution ◽  
Spectral Decomposition ◽  
Generalized Inverse ◽  
Linear Matrix ◽  
Matrix Equations ◽  
Singular Matrix ◽  
Rectangular Matrix ◽  
New Type ◽  
Linear Matrix Equations

This paper describes a generalization of the inverse of a non-singular matrix, as the unique solution of a certain set of equations. This generalized inverse exists for any (possibly rectangular) matrix whatsoever with complex elements. It is used here for solving linear matrix equations, and among other applications for finding an expression for the principal idempotent elements of a matrix. Also a new type of spectral decomposition is given.

Transformations of n-Space which Preserve a Fixed Square-Distance

1979 ◽  
Vol 31 (2) ◽  
pp. 392-395 ◽  
Author(s):  
J. A. Lester
Keyword(s):  
Singular Matrix ◽  
Linear Bijection ◽  
Image Position

1. Introduction. Our interest here lies in the following theorem:THEOREM 1. Assume there is defined on Rn (n ≧ 3) a “square-distance” of the formwhere (gij) is a given symmetric non-singular matrix over the reals and x = (x1, …, xn), y = (y1, …, yn) ∈ Rn. Assume further that f is a bijection ofRnwhich preserves a given fixed square-distance ρ, i.e. d(x, y) = ρ if and only if d(ƒ(x),ƒ(y)) = ρ. Then (unless ρ = 0 and (gij) is positive or negative definite) ƒ(x) = Lx + ƒ(0), where L is a linear bijection ofRnsatisfying d(Lx, Ly) = ±d(x, y) for all x, y ∈ Rn (the – sign is possible if and only if ρ = 0 and (gij) has signature 0).

scholarly journals Generalized Inverse of a Singular Matrix

Nature ◽  
1963 ◽  
Vol 200 (4907) ◽  
pp. 716-716
Author(s):  
J. C. KOOP
Keyword(s):  
Generalized Inverse ◽  
Singular Matrix

scholarly journals Projector Approach to Constructing Asymptotic Solution of Initial Value Problems for Singularly Perturbed Systems in Critical Case

Axioms ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 56 ◽  
Author(s):  
Galina Kurina
Keyword(s):  
Differential Equations ◽  
Asymptotic Solution ◽  
Initial Value Problems ◽  
Singular Matrix ◽  
Singularly Perturbed Systems ◽  
English Transl ◽  
Initial Value ◽  
Boundary Functions ◽  
Linear Differential ◽  
Orthogonal Projectors

Under some conditions, an asymptotic solution containing boundary functions was constructed in a paper by Vasil’eva and Butuzov (Differ. Uravn. 1970, 6(4), 650–664 (in Russian); English transl.: Differential Equations 1971, 6, 499–510) for an initial value problem for weakly non-linear differential equations with a small parameter standing before the derivative, in the case of a singular matrix A ( t ) standing in front of the unknown function. In the present paper, the orthogonal projectors onto k e r A ( t ) and k e r A ( t ) ′ (the prime denotes the transposition) are used for asymptotics construction. This approach essentially simplifies understanding of the algorithm of asymptotics construction.

scholarly journals A Numerical Method for Computing the Roots of Non-Singular Complex-Valued Matrices

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 966
Author(s):  
Diego Caratelli ◽  
Paolo Emilio Ricci
Keyword(s):  
Numerical Method ◽  
Worked Examples ◽  
Higher Order ◽  
Singular Matrix ◽  
The Matrix ◽  
General Complex ◽  
Complex Valued

A method for the computation of the n th roots of a general complex-valued r × r non-singular matrix ? is presented. The proposed procedure is based on the Dunford–Taylor integral (also ascribed to Riesz–Fantappiè) and relies, only, on the knowledge of the invariants of the matrix, so circumventing the computation of the relevant eigenvalues. Several worked examples are illustrated to validate the developed algorithm in the case of higher order matrices.

Sign in / Sign up

Export Citation Format

Share Document