Results 111 to 120 of about 949,545 (177)
INTERVAL ITERATIVE METHODS FOR COMPUTING MOORE-PENROSE INVERSE ∗
In this paper, we import interval method to the iteration for computing Moore-Penrose inverse of the full row (or column) rank matrix. Through modifying the classical Newton iteration by interval method, we can get better numerical results.
Xian Zhang, Yimin Wei, Jianfeng Cai
core
The randomization-based feedforward neural network has raised great interest in the scientific community due to its simplicity, training speed, and accuracy comparable to traditional learning algorithms.
Elkin Gelvez-Almeida +5 more
doaj +1 more source
Moore-Penrose inverse and partial orders on Hilbert space operators
In this article we explore several aspects concerning to the Moore-Penrose inverse of a bounded linear operator. On the one hand, we study monotonicity properties of the Moore-Penrose inverse with respect to the L\"owner, star, minus, sharp and diamond ...
Gonzalez, María Celeste +1 more
core
Existence Criteria and Related Relation of the gMP Inverse of Matrices
New characterizations of the gMP inverse are provided by the core part of the core-EP decomposition. We also answer the question as to whether X is the gMP inverse of A under the conditions of R(X)⊆R(A*Ak) or N((Ak)*)⊆N(X).
Sanzhang Xu, Honglin Zou, Kezheng Zuo
doaj +1 more source
Analysis of (1,2,3,4)-Type Inverses in Neutrosophic Hyper Soft Rough Fuzzy Matrices
In this paper, we introduce a method for determining the generalized inverse (g-inverse) and the Moore-Penrose inverse of Neutrosophic Hyper Soft Rough Fuzzy Matrices (NHSRFMs), along with the necessary conditions.
G. Punithavalli, K. Ramany
doaj +1 more source
THE MOORE–PENROSE INVERSE OF SYMMETRIC MATRICES WITH EQUITABLE PARTITIONS AND DIVISOR MATRICES
A balanced partitioned symmetric matrix is a matrix that has partition blocks that have the same average number of rows and columns. The sum of these average rows and columns is then arranged into a matrix, which is called the divisor matrix. The purpose
Yanita Yanita +2 more
core +1 more source
Fast Computation of Moore-Penrose Inverse Matrices
Number of pages: 5. Typo page 26 line 3: one must read W=G^+F (instead of W=G^+W, which does not make sense!)International audienceMany neural learning algorithms require to solve large least square systems in order to obtain synaptic weights.
Courrieu, Pierre
core
Moore-Penroseov matrični inverz, ali drugače psevdoinverz matrike, je posplošeni inverz za m×n matrike, ne nujno polnega ranga. Psevdoinverz je mogoče izračunati z različnimi metodami, v diplomskem delu pa se bom posvetil eni izmed njih, ki ne zahteva ...
Matušek, Matic
core
Numerical range for weighted Moore-Penrose inverse of tensor
This article first introduces the notion of weighted singular value decomposition (WSVD) of a tensor via the Einstein product. The WSVD is then used to compute the weighted Moore-Penrose inverse of an arbitrary-order tensor. We then define the notions of
Shekhar, Vaibhav +2 more
core +1 more source
Effective Computation of Coupling Force Constants: Metal Carbonyls as a Test Case. [PDF]
Borgman H, Vasisth S, Grunenberg J.
europepmc +1 more source

