In this paper we describe the history, performance, and design concepts of direct solvers for algebraic systems resulting from Galerkin discretizations of partial differential equations. Popular direct solver implementations ...

We study the performance of direct solvers on linear systems of equations resulting from isogeometric analysis. The problem of choice is the canonical Laplace equation in three dimensions. From this study we conclude that ...

Machine learning (ML) techniques have been proposed to automatically select the best solver from a portfolio of solvers, based on predicted performance. These techniques have been applied to various problems, such as Boolean ...

There is increasing evidence of the shortage of solver-based models for solving logically-constrained AC optimal power flow problem (LCOPF). Although in the literature the heuristic-based models have been widely used to ...

This article introduces a stand-alone implementation of the quantized state system (QSS) integration methods for continuous and hybrid system simulation. QSS methods replace the time discretization of classic numerical ...

In this work we are going to use the Kurchatov–Schmidt–Schwetlick-like solver (KSSLS) and the Kurchatov-like solver (KLS) to locate a zero, denoted by x∗ of operator F. We define F as F:D⊆B1⟶B2 where B1 and B2 stand for ...

The state-of-the-art SAT solvers, as Chaff, zChaff, BerkMin, and Minisat usually share the same core heuristics, for instance: conflict clause recording, non-chronological backtracking and two-watched literals. Nevertheless, ...