布伦特方程的半解析解法

IF 0.5 4区数学 Q3 MATHEMATICS

Doklady Mathematics Pub Date : 2024-10-20 DOI:10.1134/S1064562424702223

I. E. Kaporin

引用次数: 0

摘要

提出了布伦特方程的参数化方法，从而将未知数和方程的数量减少了数倍。所产生的方程采用非线性最小二乘法进行数值求解。得到的矩阵乘法算法比以前已知的算法更快。特别是找到了（(4,4,4;48)）和（(2,4,5;32)）算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Semi-Analytical Solution of Brent Equations

A parametrization of Brent equations is proposed which leads to a several times reduction of the number of unknowns and equations. The arising equations are solved numerically using a nonlinear least squares method. Matrix multiplication algorithms that are faster than previously known ones are obtained. In particular, \((4,4,4;48)\)- and \((2,4,5;32)\)-algorithms are found.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Doklady Mathematics 数学-数学

CiteScore

1.00

自引率

16.70%

发文量

审稿时长

3-6 weeks

期刊介绍： Doklady Mathematics is a journal of the Presidium of the Russian Academy of Sciences. It contains English translations of papers published in Doklady Akademii Nauk (Proceedings of the Russian Academy of Sciences), which was founded in 1933 and is published 36 times a year. Doklady Mathematics includes the materials from the following areas: mathematics, mathematical physics, computer science, control theory, and computers. It publishes brief scientific reports on previously unpublished significant new research in mathematics and its applications. The main contributors to the journal are Members of the RAS, Corresponding Members of the RAS, and scientists from the former Soviet Union and other foreign countries. Among the contributors are the outstanding Russian mathematicians.