Results 1  10
of
4,201
The condition number of the BEMmatrix arising
"... We investigate the condition number of the matrices that appear in the boundary element method. In particular we consider the Laplace equation with mixed boundary conditions. For Dirichlet boundary conditions, the condition number of the system matrix increases linearly with the number of boundary e ..."
Abstract
 Add to MetaCart
We investigate the condition number of the matrices that appear in the boundary element method. In particular we consider the Laplace equation with mixed boundary conditions. For Dirichlet boundary conditions, the condition number of the system matrix increases linearly with the number of boundary
The University of Florida sparse matrix collection
 NA DIGEST
, 1997
"... The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural enginee ..."
Abstract

Cited by 536 (17 self)
 Add to MetaCart
The University of Florida Sparse Matrix Collection is a large, widely available, and actively growing set of sparse matrices that arise in real applications. Its matrices cover a wide spectrum of problem domains, both those arising from problems with underlying 2D or 3D geometry (structural
A Singular Value Thresholding Algorithm for Matrix Completion
, 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract

Cited by 555 (22 self)
 Add to MetaCart
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 892 (13 self)
 Add to MetaCart
Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area
The condition number of the BEMmatrix arising from Laplace’s equation
 Electronic Journal of Boundary Elements
"... We investigate the condition number of the matrices that appear in the boundary element method. In particular we consider the Laplace equation with mixed boundary conditions. For Dirichlet boundary conditions, the condition number of the system matrix increases linearly with the number of boundary e ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We investigate the condition number of the matrices that appear in the boundary element method. In particular we consider the Laplace equation with mixed boundary conditions. For Dirichlet boundary conditions, the condition number of the system matrix increases linearly with the number of boundary
Condition number of the BEM matrix arising from the Stokes equations in 2D
"... We study the condition number of the system matrices that appear in the Boundary Element Method when solving the Stokes equations at a twodimensional domain. At the boundary of the domain we impose Dirichlet conditions or mixed conditions. We show that for certain critical boundary contours the und ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
the underlying boundary integral equation is not solvable. As a consequence, the condition number of the system matrix of the discrete equations is infinitely large. Hence, for these critical contours the Stokes equations cannot be solved with the Boundary Element Method. To overcome this problem the domain can
On Orthogonal and Symplectic Matrix Ensembles
 MATHEMATICAL PHYSICS
, 1996
"... The focus of this paper is on the probability, Eβ(Q; J), that a set J consisting of a finite union of intervals contains no eigenvalues for the finite N Gaussian Orthogonal (β = 1) and Gaussian Symplectic (β = 4) Ensembles and their respective scaling limits both in the bulk and at the edge of the ..."
Abstract

Cited by 259 (10 self)
 Add to MetaCart
of the spectrum. We show how these probabilities can be expressed in terms of quantities arising in the corresponding unitary (β = 2) ensembles. Our most explicit new results concern the distribution of the largest eigenvalue in each of these ensembles. In the edge scaling limit we show that these largest
Ranksparsity incoherence for matrix decomposition
, 2010
"... Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown lowrank matrix. Our goal is to decompose the given matrix into its sparse and lowrank components. Such a problem arises in a number of applications in model and system identification, and is intractable ..."
Abstract

Cited by 230 (21 self)
 Add to MetaCart
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown lowrank matrix. Our goal is to decompose the given matrix into its sparse and lowrank components. Such a problem arises in a number of applications in model and system identification, and is intractable
A steepest descent method for oscillatory Riemann–Hilbert problems: asymptotics for the MKdV equation
 Ann. of Math
, 1993
"... In this announcement we present a general and new approach to analyzing the asymptotics of oscillatory RiemannHilbert problems. Such problems arise, in particular, in evaluating the longtime behavior of nonlinear wave equations solvable by the inverse scattering method. We will restrict ourselves ..."
Abstract

Cited by 303 (27 self)
 Add to MetaCart
In this announcement we present a general and new approach to analyzing the asymptotics of oscillatory RiemannHilbert problems. Such problems arise, in particular, in evaluating the longtime behavior of nonlinear wave equations solvable by the inverse scattering method. We will restrict ourselves
DETERMINANT MAXIMIZATION WITH LINEAR MATRIX INEQUALITY CONSTRAINTS
"... The problem of maximizing the determinant of a matrix subject to linear matrix inequalities arises in many fields, including computational geometry, statistics, system identification, experiment design, and information and communication theory. It can also be considered as a generalization of the s ..."
Abstract

Cited by 223 (18 self)
 Add to MetaCart
The problem of maximizing the determinant of a matrix subject to linear matrix inequalities arises in many fields, including computational geometry, statistics, system identification, experiment design, and information and communication theory. It can also be considered as a generalization
Results 1  10
of
4,201