aux.fisch

the number of grid points for each direction.

a logical; <code>TRUE</code> for returning sparse matrix, <code>FALSE</code> otherwise.

sparse

Poisson equation is one of most well-known elliptic partial differential equations. In order to
give a concrete example, a discrete Poisson matrix is generated, assuming we have <code>N</code> number of
grid points for each dimension under square domain. fisch is a German word for Poisson.

Solving a system of linear equations is one of the most fundamental
computational problems for many fields of mathematical studies, such as
regression problems from statistics or numerical partial differential equations.
We provide basic stationary iterative solvers such as Jacobi, Gauss-Seidel,
Successive Over-Relaxation and SSOR methods. Nonstationary, also known as
Krylov subspace methods are also provided. Sparse matrix computation is also supported
in that solving large and sparse linear systems can be manageable using 'Matrix' package
along with 'RcppArmadillo'. For a more detailed description, see a book by Saad (2003)
<doi:10.1137/1.9780898718003>.

Kisung You

Rlinsolve

Iterative Solvers for (Sparse) Linear System of Equations

aux.fisch function

<dl><dt>N</dt>
<dd>the number of grid points for each direction.</dd>
<dt>sparse</dt>
<dd>a logical; <code>TRUE</code> for returning sparse matrix, <code>FALSE</code> otherwise.</dd></dl>

Arguments

Generate a 2-dimensional discrete Poisson matrix — aux.fisch

<dl>

<dt>N</dt>
<dd>the number of grid points for each direction.</dd>


<dt>sparse</dt>
<dd>a logical; <code>TRUE</code> for returning sparse matrix, <code>FALSE</code> otherwise.</dd>

</dl>

aux.fisch: Generate a 2-dimensional discrete Poisson matrix

Description

Usage

Value

Arguments

References

Examples