## On CSlR-ILU preconditioning and its implementation in GMRES(m)

An ILU(0) modification for sparse matrices storage technique called the CSlR is discussed and briefly analyzed. Details of program implementation for the GMRES(m) preconditioning are described for C language.

balandin.pdf2.49 MB

## Simulation of random variables in module Resonance of the package ACCORD

We present here general principles of organization of the module "Resonance" for stochastic simulation, which is a part of the package "ACCORD", and describe basic procedures of the module for simulation of random variables.

belov.pdf4.82 MB

## The on-line library of algorithms and programs ACCORD

The on-line library ACCORD includes algorithms for solving different tasks of mathematical modeling. The description of the algorithms is in the special database, which contains description of algorithms, the author software source code and executable components, which allows the users to try algorithms. The access to the library resources is...

gololobova.pdf2.48 MB

## Program package for 3D boundary-value elliptic problem

The main topic of the paper is to present a program package to solve 3D BVP for the Helmholtz-type equation. Numerical algorithms concerning data structures, approximations, and solving are described. Structure of the input data file and the usage examples are presented. Some useful recommendations for users are given.

gurieva.pdf5.42 MB

## Two explicit incomplete factorization methods

Two explicit incomplete factorization methods and their program implementation are presented for solution of linear algebraic systems with real symmetric positive definite (SPD) matrices. The algorithms are based on the efficient Eisenstat modification of preconditioning for the matrix row sparse format. The fast iterative convergence is provided by conjugate gradient...

ilin.pdf2.71 MB

## The generator of RK-scheme GRKSCHEM

The generator of M-stage modified RK-scheme, 2 < M < 21, for solving the ODE y' = f(t,y) with initial conditions and the Volterra integral equation (by the RK-method of advanced accuracy) is proposed. Modified and classical RK-methods differ for a triangular matrix B only are used.

kuznecov.pdf3.51 MB

## Computation of a few smallest eigenvalues and their eigenvectors for large sparse SPD matrices

The algorithm and the code for computing several eigenvalues and their corresponding eigenvectors of a large sparse symmetric positive definite (SPD) matrix, which arises as a result of grid approximations (FDM, FEM, or FVM) of multidimensional boundary value problems (BVPs) are described. The preconditioned inverse iteration (PINVIT) method is implemented...

larin.pdf3.5 MB

## The program NODEI for solution of differential-algebraic ODE systems

The paper presents an algorithm for the numerical solution of the initial value problems for implicit systems of ordinary differential equations (ODE). The algorithm uses the Rosenbrock-type scheme with time-lagging derivative matrices, and the adaptive step size control for the global error. Some examples of solution of test problems are...

levykin.pdf2 MB

## The program NODE for solution of ODE stiff systems

The paper introduces an algorithm for the numerical solution of initial value problems for systems of ordinary differential equations (ODE). The algorithm uses the Rosenbrock-type and the Runge-Kutta-type schemes with Jacobian freezing and automatic step size control policy based on the global error estimation. Some examples of solution of test...

novikov.pdf1.84 MB

## Linear optimization programs

The paper presents the software for the linear programming problems both for the integer and the mixed-integer linear programming. For the solution of problems of the above types it is possible to exploit a parallel algorithm. Some examples of solution of test problems are given.

zabinyako.pdf3.95 MB
{"ft_lang_label":"__label__en","ft_lang_prob":0.8556314,"math_prob":0.96104115,"size":3667,"snap":"2019-51-2020-05","text_gpt3_token_len":707,"char_repetition_ratio":0.14496315,"word_repetition_ratio":0.054820415,"special_character_ratio":0.17371148,"punctuation_ratio":0.08305648,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9885564,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-10T02:24:21Z\",\"WARC-Record-ID\":\"<urn:uuid:205e454e-ca62-43f7-b8c7-a5ce6509de7c>\",\"Content-Length\":\"138122\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b93888b7-4677-48bc-b28f-63ad726eb297>\",\"WARC-Concurrent-To\":\"<urn:uuid:9a97cab4-9ac3-4262-a909-7ed0b623fff3>\",\"WARC-IP-Address\":\"84.237.72.72\",\"WARC-Target-URI\":\"https://bulletin.iis.nsk.su/issue/numerical-analysis/11\",\"WARC-Payload-Digest\":\"sha1:2ONF4XCTUHORXOKUBQJ3S76AP6QIFP7F\",\"WARC-Block-Digest\":\"sha1:QHXTKUE73CVAXHP5CU5B7TGSKUZX4IXE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575540525781.64_warc_CC-MAIN-20191210013645-20191210041645-00261.warc.gz\"}"}