We present two computationally inexpensive techniques for estimating the numerical rank of a matrix, combining powerful tools from computational linear algebra. These techniques exploit three key ingredients. The first is to approximate the projector on the non-null invariant subspace of the matrix by using a polynomial filter. Two types of filters are discussed, one based on Hermite interpolat...

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that pro...

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that pro...

In [MR], the second author and H. P. Rosenthal constructed the first examples of weakly null normalized sequences which do not have any unconditionally basic subsequences. Much more recently, the second author and W. T. Gowers [GM] constructed infinite dimensional Banach spaces which do not contain any unconditionally basic sequences. These later examples are of a different character than the e...

In this work we derive the structural properties of the Collocation coefficient matrix associated with the Dirichlet-Neumann map for Laplace’s equation on a square domain. The analysis is independent of the choice of basis functions and includes the case involving the same type of boundary conditions on all sides, as well as the case where different boundary conditions are used on each side of ...

In the paper [8], the author introduced a set of Chebyshev-like points for polynomial interpolation (by a certain subspace of polynomials) in the square [−1, 1], and derived a compact form of the corresponding Lagrange interpolation formula. In [1] we gave an efficient implementation of the Xu interpolation formula and we studied numerically its Lebesgue constant, giving evidence that it grows ...

We consider a weakly interacting, harmonically trapped Bose-Einstein condensed gas under rotation and investigate the connection between the energies obtained from mean-field calculations and from exact diagonalizations in a subspace of degenerate states. From the latter we derive an approximation scheme valid in the thermodynamic limit of many particles. Mean-field results are shown to emerge ...

Gradient iterations for the Rayleigh quotient are elemental methods for computing the smallest eigenvalues of a pair of symmetric and positive definite matrices. A considerable convergence acceleration can be achieved by preconditioning and by computing Rayleigh-Ritz approximations from subspaces of increasing dimensions. An example of the resulting Krylov subspace eigensolvers is the generaliz...

A polynomial filtered Davidson-type algorithm is proposed for symmetric eigenproblems, in which the correction-equation of the Davidson approach is replaced by a polynomial filtering step. The new approach has better global convergence and robustness properties when compared with standard Davidson-type methods. The typical filter used in this paper is based on Chebyshev polynomials. The goal of...

In this paper we analyze a class of projection operators with values in a subspace of polynomials. These projection operators are related to the Hubert spaces involved in the numerical analysis of spectral methods. They are, in the first part of the paper, the standard Sobolev spaces and, in the second part, some weighted Sobolev spaces, the weight of which is related to the orthogonality relat...