Results 221 to 230 of about 30,879 (264)

Guaranteed Eigenvalue Bounds for the Steklov Eigenvalue Problem [PDF]

open access: yesSIAM Journal on Numerical Analysis, 2019
To provide mathematically rigorous eigenvalue bounds for the Steklov eigenvalue problem, an enhanced version of the eigenvalue estimation algorithm developed by the third author is proposed, which removes the requirements of the positive definiteness of bilinear forms in the formulation of eigenvalue problems.
Xuefeng LIU
exaly   +4 more sources
Some of the next articles are maybe not open access.

Related searches:

On an Anisotropic Eigenvalue Problem

Results in Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhenhai Liu, Nikolaos S. Papageorgiou
openaire   +2 more sources

On the higher eigenvalues for the $\infty$ -eigenvalue problem

Calculus of Variations and Partial Differential Equations, 2005
The authors consider a nonlinear eigenvalue problem associated with a limiting version of the \(p\)-Laplacian for \(p=\infty\). Namely, if \(\Omega\) is an open subset of \(\mathbb R^n\), \(S_{n\times n}\) is the set of \(n\times n\) real symmetric matrices with real entries, the authors consider the nonlinear problem \( F_{\Lambda}(u,Du,D^2u)=0\) in \(
Juutinen, Petri, Lindqvist, Peter
openaire   +1 more source

Dependence of Eigenvalues on the Problem

Mathematische Nachrichten, 1997
AbstractThe eigenvalues of linear, regular, two point boundary value problems depend continuously on the problem. In the important self‐adjoint case studied by Naimark and Weidmann this dependence is differentiable and the derivatives of the eigenvalues with respect to a given parameter: an endpoint, a boundary condition, a coefficient, or the weight ...
Kong, Q., Wu, H., Zettl, A.
openaire   +1 more source

Inverse Eigenvalue Problems

SIAM Review, 1998
In the inverse eigenvalue problem, one has to construct a matrix with a (partially) given spectrum. The problem appears in many different forms and in many different applications. Usually the problem is constrained in the sense that the matrix \(M\) that one wants to find has to be in a certain class. For example it should be of the form \(M=A+X\) or \(
openaire   +1 more source

On a controlled eigenvalue problem

Systems & Control Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anup Biswas, Vivek S. Borkar
openaire   +3 more sources

On a Quadratic Eigenvalue Problem

SIAM Journal on Mathematical Analysis, 1974
It is shown that the eigenvalue problem $u'' + Bu(\lambda ^2 + \lambda p)u$; $u(0) = u(1) = 0$ (where p is a positive function and B an arbitrary bounded operator on $L^2 [0,1]$ possesses in general two different sets of eigenfunctions, each of which is an unconditional basis for $L^2$ and other spaces.
openaire   +2 more sources

Computation of Selected Eigenvalues of Generalized Eigenvalue Problems

Journal of Computational Physics, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nayar, Narinder, Ortega, James M.
openaire   +1 more source

On the computation of all eigenvalues for the eigenvalue complementarity problem

Journal of Global Optimization, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luís M. Fernandes   +3 more
openaire   +3 more sources

A note on unimodular eigenvalues for palindromic eigenvalue problems

International Journal of Computer Mathematics, 2012
We consider the occurrence of unimodular eigenvalues for palindromic eigenvalue problems associated with the matrix polynomial where A i *= A n − i with M * ≡ M T, M H or . From the properties of palindromic eigenvalues and their characteristic polynomials, we show that eigenvalues are not generically excluded from the unit circle, thus
Chun-Yueh Chiang   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy