We investigate the singular value decomposition (SVD) of a rectangular matrix of functions
that are analytic on an annulus that includes at least the unit circle. Such matrices occur, eg …

This article considers the problem of approximating a general asymptotically smooth
function in two variables, typically arising in integral formulations of boundary value …

In this chapter let TI and TJ be binary cluster trees for the index sets I and J, respectively. A
generalization to arbitrary cluster trees is possible; see Sect. 4.5 for nested dissection cluster …

We present a generalized Bloch wave framework for the dynamic analysis of structures with
nonlocal interactions and apply it to the design of origami acoustic metamaterials …

Abstract The Module Learning With Errors (M-LWE) problem is a core computational
assumption of lattice-based cryptography which offers an interesting trade-off between …

The adaptive cross approximation method can be used to efficiently approximate stiffness
matrices arising from boundary element applications by hierarchical matrices. In this article …

The problem of computing in an efficient and accurate way the armor losses in three-core
AC submarine cables has been of great interest to the offshore cable community for some …

We provide an overview of matrix decomposition algorithms (MDAs) for the solution of
systems of linear equations arising when various discretization techniques are applied in the …

During the last decade essential progress has been achieved in the analysis and
implementation of multilevel/rnultigrid and domain decomposition methods to explore a …

Circulant matrices are an important family of operators, which have a wide range of
applications in science and engineering-related fields. They are, in general, non-sparse and …