Direct multiplicative methods for sparse matrices. Newton methods-Reference-Cited by-同舟云学术

Direct multiplicative methods for sparse matrices. Newton methods

Published:2017-10 Issue:5 Volume:9 Page:679-703
ISSN:2076-7633
Container-title:Computer Research and Modeling
language:
Short-container-title:CRM

Author:

Sviridenko Anastasiya Borisovna

Publisher

Izhevsk Institute of Computer Science

Subject

Computational Theory and Mathematics,Computer Science Applications,Modeling and Simulation

Reference101 articles.

1. В. Л. Береснев. Дискретные задачи размещения и полиномы от булевых переменных. - Новосибирск: Изд-во ин-та математики, 2005. - 408 с.

2. V. L. Beresnev. Discrete location problems and polynomials of Boolean variables. - Novosibirsk: The publisher of the Institute of mathematics, 2005. - 408 p. - in Russian.

3. В. Л. Береснев. Алгоритмы минимизации полиномов от булевых переменных // Проблемы кибернетики. - М: Наука, 1979. - № 36. - С. 225-246.

4. V. L. Beresnev. Algorithms for minimization of polynomials in Boolean variables // Problems of Cybernetics. - Moscow: Nauka, 1979. - V. 36. - P. 225-246. - in Russian.

5. В. Л. Береснев, Э. Х. Гимади, В. Т. Дементьев. Экстремальные задачи стандартизации. - Новосибирск: Наука, 1978.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Numerical differentiation of table-given functions at arbitrarily located interpolation nodes;Ukrainian Journal of Information Technology;2023

2. Designing a zero on a linear manifold, a polyhedron, and a vertex of a polyhedron. Newton methods of minimization;Computer Research and Modeling;2019-08

3. Direct multiplicative methods for sparse matrices. Quadratic programming;Computer Research and Modeling;2018-08