Real-time computation of singular vectors (Q1126572): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Neural networks for solving systems of linear equations and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural networks for solving systems of linear equations. II. Minimax and least absolute value problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neural network for computing eigenvectors and eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrent neural networks for LU decomposition and Cholesky factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural network approach to computing matrix inversion / rank
 
Normal rank

Latest revision as of 13:33, 28 May 2024

scientific article
Language Label Description Also known as
English
Real-time computation of singular vectors
scientific article

    Statements

    Real-time computation of singular vectors (English)
    0 references
    0 references
    0 references
    0 references
    25 January 1999
    0 references
    An analog circuit approach for the singular vector decomposition in real-time is considered. An analog computational model is proposed as a specialized analog computer. The asynchronous parallel processing, continuous-time dynamics, and high-speed computational capabilities are the key features of the proposed model. It is shown analytically and by simulation that the proposed circuit can provide the desired singular vectors of a given matrix \(A\), with arbitrarily small error during elapsed time of only a few characteristics time constants of the circuits. In addition, the parameters of the circuit can be obtained from the given matrix without any computation. For the practical use, the case is generalized for the complex values of the matrix. Based on the obtained simulation results it is demonstrated that the proposed approach is more powerful than the known sequential techniques for the singular vector decomposition.
    0 references
    0 references
    singular value decomposition
    0 references
    singular vector decomposition
    0 references
    analog computational model
    0 references
    parallel processing
    0 references