Results 211 to 220 of about 1,042 (247)
Some of the next articles are maybe not open access.

Vehicle Dynamics Equation Identified by combined Invariant Subspace & Subspace Method

2023 35th Chinese Control and Decision Conference (CCDC), 2023
Jingze You   +3 more
exaly   +2 more sources

Invariant subspace method to the initial and boundary value problem of the higher dimensional nonlinear time-fractional PDEs

open access: yesCommunications in Nonlinear Science and Numerical Simulation, 2023
This paper systematically explains how to apply the invariant subspace method using variable transformation for finding the exact solutions of the (k+1)-dimensional nonlinear time-fractional PDEs in detail.
K S Priyendhu   +2 more
exaly   +3 more sources

Invariant subspace method for eigenvalue computation

IEEE Transactions on Power Systems, 1993
Methods which first subdivide a large power system into subsystems, and which then study how the interactions between subsystems cause the eigenvalues and eigenvectors to vary between the subsystems and the total system are presented. The invariant subspace method, which allows eigenvalues that are difficult to study individually to be grouped into a ...
D.J. Stadnicki, J.E. Van Ness
openaire   +1 more source

A Supervised Low-Rank Method for Learning Invariant Subspaces

2015 IEEE International Conference on Computer Vision (ICCV), 2015
Sparse representation and low-rank matrix decomposition approaches have been successfully applied to several computer vision problems. They build a generative representation of the data, which often requires complex training as well as testing to be robust against data variations induced by nuisance factors.
Farzad Siyahjani   +3 more
openaire   +1 more source

Linear-quadratic mean field control: The invariant subspace method

Automatica, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiang Chen, Minyi Huang
openaire   +1 more source

Nonlinear two-component system of time-fractional PDEs in (2+1)-dimensions: Invariant subspace method combined with variable transformation

open access: yesCommunications in Nonlinear Science and Numerical Simulation
In this article, we develop a systematic approach of the invariant subspace method combined with variable transformation to find the generalized separable exact solutions of the nonlinear two-component system of time-fractional PDEs (TFPDEs) in (2+1 ...
P Prakash   +2 more
exaly   +3 more sources

Kernel-based invariant subspace method for hyperspectral target detection

2004 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2004
In this paper, a kernel-based invariant subspace detection method is proposed for small target detection of hyperspectral images. The method combines kernel principal component analysis (KPCA) and the linear mixture model (LMM). The LMM is used to describe each pixel in the hyper-spectral image as a mixture of target, background and noise.
Ye Zhang 0008, Yanfeng Gu
openaire   +1 more source

Three methods for refining estimates of invariant subspaces

Computing, 1987
We compare three methods for refining estimates of invariant subspaces, due to \textit{F. Chatelin} [Comput. Suppl. 5, 67-74 (1984; Zbl 0555.65023)], \textit{J. Dongarra}, \textit{C. Moler} and \textit{J. Wilkinsons} [SIAM J. Numer. Anal. 20, 23-45 (1983; Zbl 0523.65021)] and \textit{G. Stewart} [SIAM Rev. 15, 727-764 (1973; Zbl 0297.65030)].
openaire   +1 more source

On the matrix sign function method for the computation of invariant subspaces

Proceedings of Joint Conference on Control Applications Intelligent Control and Computer Aided Control System Design, 2002
There is some concern about the numerical stability of algorithms that use the matrix sign function to solve Riccati and Lyapunov equations and to find bases of invariant subspaces. In this paper, we demonstrate that evaluating the matrix sign function is a more ill-conditioned computational problem than the problem of finding bases of the two ...
R. Byers, null Chunyang He, V. Mehrmann
openaire   +1 more source

4. Structured Invariant Subspace Methods

2011
The numerical solution of an algebraic Riccati equation can be reduced to the computation of an invariant subspace of a suitable matrix or a deflating subspace of a suitable pencil.
Dario Andrea Bini   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy