Results 31 to 40 of about 6,191,058 (318)
Complexity issues for the symmetric interval eigenvalue problem
Open Mathematics, 2014 We study the problem of computing the maximal and minimal possible eigenvalues of a symmetric matrix when the matrix entries vary within compact intervals. In particular, we focus on computational complexity of determining these extremal eigenvalues with
Hladík Milan
doaj +1 more source
Symbolic Algorithm for Inverting General k-Tridiagonal Interval Matrices
International Journal of Analysis and Applications, 2023 The k-tridiagonal matrices have received much attention in recent years. Many different algorithms have been proposed to improve the efficiency of k-tridiagonal matrix estimation.
Sivakumar Thirupathi +1 more
doaj +1 more source
Yangian Symmetry and Quantum Inverse Scattering Method for the One-Dimensional Hubbard Model
, 1996 We develop the quantum inverse scattering method for the one-dimensional Hubbard model on the infinite interval at zero density. $R$-matrix and monodromy matrix are obtained as limits from their known counterparts on the finite interval.
Bares +45 more
core +2 more sources
Interval Prediction for Continuous-Time Systems with Parametric Uncertainties [PDF]
, 2019 The problem of behaviour prediction for linear parameter-varying systems is considered in the interval framework. It is assumed that the system is subject to uncertain inputs and the vector of scheduling parameters is unmeasurable, but all uncertainties ...
Efimov, Denis +3 more
core +4 more sources
A polynomial algorithm for the k-cluster problem on interval graphs
, 2008 This paper deals with the problem of finding, for a given graph and a given natural number k, a subgraph of k nodes with a maximum number of edges. This problem is known as the k-cluster problem and it is NP-hard on general graphs as well as on chordal ...
Mertzios, George B.
core +1 more source
Modified Crout’s method for an LU decomposition of an interval matrix
, 2018 In this paper, we propose an algorithm for computing LU decomposition of an interval matrix using modified Crout’s method based on generalized interval arithmetic on interval numbers.
T. Nirmala, K. Ganesan
semanticscholar +1 more source
MathematicsThe iterative decreasing dimension method (IDDM) is an iterative method used to solve the linear algebraic system Ax=f. Such systems are important in modeling many problems in applied sciences. For a number of reasons, such as estimated measurements made
Gülnur Çelik Kızılkan +1 more
doaj +1 more source
Matrix Games with Interval-Valued 2-Tuple Linguistic Information
Games, 2018 In this paper, a two-player constant-sum interval-valued 2-tuple linguistic matrix game is construed. The value of a linguistic matrix game is proven as a non-decreasing function of the linguistic values in the payoffs, and, hence, a pair of auxiliary ...
Anjali Singh, Anjana Gupta
doaj +1 more source
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs [PDF]
, 2013 Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a linear-time algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal forbidden submatrices
Lindzey, Nathan, McConnell, Ross M.
core +1 more source
Accelerating interval matrix multiplication by mixed precision arithmetic
, 2015 This paper is concerned with real interval arithmetic. We focus on interval matrix multiplication. Well-known algorithms for this purpose require the evaluation of several point matrix products to compute one interval matrix product.
K. Ozaki, T. Ogita, F. Bünger, S. Oishi
semanticscholar +1 more source