Related papers: Bordering for spectrally arbitrary sign patterns

In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known…

This paper is concerned with a novel deep learning method for variational problems with essential boundary conditions. To this end, we first reformulate the original problem into a minimax problem corresponding to a feasible augmented…

We develop a max-plus spectral theory for infinite matrices. We introduce recurrence and tightness conditions, under which many results of the finite dimensional theory, concerning the representation of eigenvectors and the asymptotic…

When modeling propagation and scattering phenomena using integral equations discretized by the boundary element method, it is common practice to approximate the boundary of the scatterer with a mesh comprising elements of size approximately…

Boundary element methods (BEM) reduce a partial differential equation in a domain to an integral equation on the domain's boundary. They are particularly attractive for solving problems on unbounded domains, but handling the dense matrices…

We construct spectral triples on C*-algebraic extensions of unital C*-algebras by stable ideals satisfying a certain Toeplitz type property using given spectral triples on the quotient and ideal. Our construction behaves well with respect…

In this paper, two new efficient algorithms for calculating the sign function of the large-scale sparse matrix are proposed by combining filtering algorithm with Newton method and Newton Schultz method respectively. Through the theoretical…

The exact parameter values of mathematical models are often uncertain or even unknown. Nevertheless, we may have access to crude information about the parameters, e.g., that some of them are nonzero. Such information can be captured by…

We propose a theoretical framework for the image source method that generalizes to arbitrary reflecting boundaries, e.g. boundaries that are curved or even with certain openings. Furthermore, it can seamlessly incorporate boundary…

In this paper we apply a scaling invariance analysis to reduce a class of parabolic moving boundary problems to free boundary problems governed by ordinary differential equations. As well known free boundary problems are always non-linear…

We survey algorithms and bounds for constructing planar drawings of graphs in small area.

We present algorithms for computing strongly singular and near-singular surface integrals over curved triangular patches, based on singularity subtraction, the continuation approach, and transplanted Gauss quadrature. We demonstrate the…

A simple recursive scheme for parameterisation of n-by-n unitary matrices is presented.

In this paper, we consider the solvability of a class of nonlinear fourth order integro-differential equations with Navier boundary condition. We first deal with a corresponding linear problem and establish a maximum principle. Using the…

Given a frame in a finite dimensional Hilbert space we construct additive perturbations which decrease the condition number of the frame. By iterating this perturbation, we introduce an algorithm that produces a tight frame in a finite…

Wideband communication receivers often deal with the problems of detecting weak signals from distant sources received together with strong nearby interferers. When the techniques of random modulation are used in communication system…

We propose a new approach for metric learning by framing it as learning a sparse combination of locally discriminative metrics that are inexpensive to generate from the training data. This flexible framework allows us to naturally derive…

The spectral method for building first integrals of ordinary linear differential systems is elaborated. Using this method, we obtain bases of first integrals for linear differential systems with constant coefficients, for linear…

We construct fast, structure-preserving iterations for computing the sign decomposition of a unitary matrix $A$ with no eigenvalues equal to $\pm i$. This decomposition factorizes $A$ as the product of an involutory matrix $S =…

We consider invertible linear maps with additive spherical bounded noise. We show that minimal attractors of such random dynamical systems are unique, strictly convex and have a continuously differentiable boundary. Moreover, we present an…