The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems. This paper describes a first implementation of an out-of-core extension to a parallel multifrontal solver (MUMPS). We show that larger problems can be solved on limited-memory machines with reasonable performance, and we illustrate the behaviour of our parallel out-of-core factorization. Then we use s...

Adobe’sMultipleMaster font format has some of the properties thatMETAFONT pioneered toexpressmanyfontsofthesamefamilyfrom thesame(set of) sources. Theadvent ofmultiple master fonts could offer a significantlybetter choiceof fonts tousersofTEX;however, thereare problems integratingthemwith TEX, and thepaper presents afirst solution to thoseproblems. Thepaper isderived(byRobinFairbairns) fromanar...

This paper presents an implementation of the configware/software SAT solver proposed in FCCM'O1 [11. This is the first actually implemented hardware accelerated solver that can dispense with instance-specific compilation, and is capable of handling SAT formulas of virtually any size.

A scheme for allowing a problem-solver to improve its performance with experience is outlined. A more complete definition of the scheme for a particular problem-solving program is given. Some results showing the effectiveness of the scheme are reported.

We consider the semidiscrete upwind scheme (0.1) u(t, x)t + 1 ( f ( u(t, x) ) − f ( u(t, x− ) )) = 0. We prove that if the initial data ū of (0.1) has small total variation, then the solution u (t) has uniformly bounded BV norm, independent of t, . Moreover by studying the equation for a perturbation of (0.1) we prove the Lipschitz continuous dependence of u (t) on the initial data. Using a tec...

This paper presents OPEN-WBO, a new MaxSAT solver. OPEN-WBO has two main features. First, it is an open-source solver that can be easily modified and extended. Most MaxSAT solvers are not available in open-source, making it hard to extend and improve current MaxSAT algorithms. Second, OPENWBO may use any MiniSAT-like solver as the underlying SAT solver. As many other MaxSAT solvers, OPEN-WBO re...

Ario is a solver for systems of linear integer arithmetic logic. Such systems are commonly used in design verification applications and are classified under Satisfiability Modulo Theories (SMT) problems. Recognizing the fact that in many such applications the majority of atoms are equalities or integer unit-two-variable inequalities (UTVPIs), we present a framework that integrates specialized t...

The paper presents a parallel direct solver for multi-physics problems. The solver is dedicated for solving problems resulting from adaptive Finite Element Method computations. The concept of finite element is actually replaced by the concept of the node. The computational mesh consists of several nodes, related to element vertices, edges, faces and interiors. The ordering of unknowns in the so...

In this paper, we present a hybrid method for deciding problems involving integer and Boolean variables which is based on generic SAT solving techniques augmented with a) a polynomial-time ILP solver for the special class of Unit-Two-Variable-Per-Inequality (unit TVPI or UTVPI) constraints and b) an independent solver for general integer linear constraints. In our approach, we present a novel m...