Analytical solution of a class of coupled second order differential- difference equations.
Anisotropic complex structure on the pseudo-Euclidean Hurwitz pairs
The concept of supercomplex structure is introduced in the pseudo-Euclidean Hurwitz pairs and its basic algebraic and geometric properties are described, e.g. a necessary and sufficient condition for the existence of such a structure is found.
Annuallatoren von Pfisterformen über semilokalen Ringen.
Another formulation of the Wick’s theorem. Farewell, pairing?
The algebraic formulation of Wick’s theorem that allows one to present the vacuum or thermal averages of the chronological product of an arbitrary number of field operators as a determinant (permanent) of the matrix is proposed. Each element of the matrix is the average of the chronological product of only two operators. This formulation is extremely convenient for practical calculations in quantum field theory, statistical physics, and quantum chemistry by the standard packages of the well known...
AnS-type upper bound for the largest singular value of nonnegative rectangular tensors
An S-type upper bound for the largest singular value of a nonnegative rectangular tensor is given by breaking N = {1, 2, … n} into disjoint subsets S and its complement. It is shown that the new upper bound is smaller than that provided by Yang and Yang (2011). Numerical examples are given to verify the theoretical results.
Antiprojectors with applications in the spectral theory
Application de la généralisation du principe de correspondance à la théorie de l'élimination
Application du théorème de Sylvester à la localisation des valeurs propres de dans le cas symétrique
Application of matrix polynomials to investigation of singular equations.
Application of the Drazin inverse to the analysis of descriptor fractional discrete–time linear systems with regular pencils
Application of the Drazin inverse to the analysis of descriptor fractional discrete-time linear systems with regular pencils
The Drazin inverse of matrices is applied to find the solutions of the state equations of descriptor fractional discrete-time systems with regular pencils. An equality defining the set of admissible initial conditions for given inputs is derived. The proposed method is illustrated by a numerical example.
Application of the partitioning method to specific Toeplitz matrices
We propose an adaptation of the partitioning method for determination of the Moore-Penrose inverse of a matrix augmented by a block-column matrix. A simplified implementation of the partitioning method on specific Toeplitz matrices is obtained. The idea for observing this type of Toeplitz matrices lies in the fact that they appear in the linear motion blur models in which blurring matrices (representing the convolution kernels) are known in advance. The advantage of the introduced method is a significant...
Applications Lineaires Affines Multivoques
Applications of max algebra to diagonal scaling of matrices.
Applications of the characteristic identity for GL(N)
Applications of the Moore-Penrose inverse in digital image restoration.
Applied mathematics meets signal processing.
Approximate polynomial GCD
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
A framework to extend the singular value decomposition of a matrix to a real linear operator 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.
Approximating the isoperimetric number of strongly regular graphs.