Numerical methods for boundary value problems on random domains [PDF]
In this thesis, we consider the numerical solution of elliptic boundary value problems on random domains. The underlying domain is modelled via a random vector field which is given by its mean and its covariance.
Peters, Michael
core +1 more source
Off-grid direction-of-arrival estimation for wideband noncircular sources
Researchers have recently shown an increased interest in estimating the direction-of-arrival (DOA) of wideband noncircular sources, but existing studies have been restricted to subspace-based methods.
Xiaoyu Zhang +3 more
doaj +1 more source
An Efficient overloaded implementation of forward mode automatic differentiation in MATLAB [PDF]
The Mad package described here facilitates the evaluation of first derivatives of multidimensional functions that are defined by computer codes written in MATLAB.
Forth, Shaun A.
core +1 more source
Jacobian Code Generated by Source Transformation and Vertex Elimination can be as Efficient as Hand-Coding [PDF]
This article presents the first extended set of results from ELIAD, a source- transformation implementation of the vertex-elimination Automatic Differentiation approach to calculating the Jacobians of functions defined by Fortran code (Griewank and ...
Reid, John K. +7 more
core +1 more source
Quasi-randomness and algorithmic regularity for graphs with general degree distributions [PDF]
We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to express how much a given graph “resembles” a random one.
Schacht, Mathias +5 more
core +1 more source
Symbolic algorithm for solving SLAEs with multi-diagonal coefficient matrices
Systems of linear algebraic equations with multi-diagonal coefficient matrices may arise after many different scientific and engineering problems, as well as problems of the computational linear algebra where finding the solution of such a system of ...
Veneva Milena
doaj +1 more source
Methods and effective algorithms for solving multidimensional integral equations
Objectives. Integral equations have long been used in mathematical physics to demonstrate existence and uniqueness theorems for solving boundary value problems for differential equations. However, despite integral equations have a number of advantages in
A. B. Samokhin
doaj +1 more source
Quantum-inspired algorithms in practice [PDF]
We study the practical performance of quantum-inspired algorithms for recommendation systems and linear systems of equations. These algorithms were shown to have an exponential asymptotic speedup compared to previously known classical methods for ...
Juan Miguel Arrazola +3 more
doaj +1 more source
Element Aggregation for Estimation of High-Dimensional Covariance Matrices
This study addresses the challenge of estimating high-dimensional covariance matrices in financial markets, where traditional sparsity assumptions often fail due to the interdependence of stock returns across sectors.
Jingying Yang
doaj +1 more source
Direct multiplicative methods for sparse matrices. Linear programming [PDF]
Multiplicative methods for sparse matrices are best suited to reduce the complexity of operations solving systems of linear equations performed on each iteration of the simplex method.
Anastasiya Borisovna Sviridenko
doaj +1 more source

