Cache optimization for structured and unstructured grid multigrid.
Checking nonsingularity of tridiagonal matrices.
Checking positive definiteness or stability of symmetric interval matrices is NP-hard
It is proved that checking positive definiteness, stability or nonsingularity of all [symmetric] matrices contained in a symmetric interval matrix is NP-hard.
Coarsening invariance and bucket-sorted independent sets for algebraic multigrid.
Communication balancing in parallel sparse matrix-vector multiplication.
Comparison of Linear System Solvers Applied to Diffusion-Type Finite Element Equations.
Complexity issues for the symmetric interval eigenvalue problem
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 some approximation error. Besides the classical absolute and relative approximation errors, which turn out not to be suitable for this problem, we adapt a less known one related to the relative error, and also propose a novel approximation error....
Computation of the demagnetizing potential in micromagnetics using a coupled finite and infinite elements method
This paper is devoted to the practical computation of the magnetic potential induced by a distribution of magnetization in the theory of micromagnetics. The problem turns out to be a coupling of an interior and an exterior problem. The aim of this work is to describe a complete method that mixes the approaches of Ying [12] and Goldstein [6] which consists in constructing a mesh for the exterior domain composed of homothetic layers. It has the advantage of being well suited for catching the decay...
Computation of the demagnetizing potential in micromagnetics using a coupled finite and infinite elements method
This paper is devoted to the practical computation of the magnetic potential induced by a distribution of magnetization in the theory of micromagnetics. The problem turns out to be a coupling of an interior and an exterior problem. The aim of this work is to describe a complete method that mixes the approaches of Ying [12] and Goldstein [6] which consists in constructing a mesh for the exterior domain composed of homothetic layers. It has the advantage of being well suited for catching the...
Computer implementation of a coupled boundary and finite element methods for the steady exterior Oseen problem.
Computing with the Square Root of NOT
To the two classical reversible 1-bit logic gates, i.e. the identity gate (a.k.a. the follower) and the NOT gate (a.k.a. the inverter), we add an extra gate, the square root of NOT. Similarly, we add to the 24 classical reversible 2-bit circuits, both the square root of NOT and the controlled square root of NOT. This leads to a new kind of calculus, situated between classical reversible computing and quantum computing.
Concepts—An object-oriented software package for partial differential equations
Object oriented design has proven itself as a powerful tool in the field of scientific computing. Several software packages, libraries and toolkits exist, in particular in the FEM arena that follow this design methodology providing extensible, reusable, and flexible software while staying competitive to traditionally designed point tools in terms of efficiency. However, the common approach to identify classes is to turn data structures and algorithms of traditional implementations into classes such...
Concepts—An Object-Oriented Software Package for Partial Differential Equations
Object oriented design has proven itself as a powerful tool in the field of scientific computing. Several software packages, libraries and toolkits exist, in particular in the FEM arena that follow this design methodology providing extensible, reusable, and flexible software while staying competitive to traditionally designed point tools in terms of efficiency. However, the common approach to identify classes is to turn data structures and algorithms of traditional implementations into ...
Contribution à la résolution numérique des équations de Laplace et de la chaleur
Convergence and quasi-optimal complexity of a simple adaptive finite element method
We prove convergence and quasi-optimal complexity of an adaptive finite element algorithm on triangular meshes with standard mesh refinement. Our algorithm is based on an adaptive marking strategy. In each iteration, a simple edge estimator is compared to an oscillation term and the marking of cells for refinement is done according to the dominant contribution only. In addition, we introduce an adaptive stopping criterion for iterative solution which compares an estimator for the iteration error...
Cover pages
Co-volume methods for degenerate parabolic problems.