Info

この質問は閉じられています。 編集または回答するには再度開いてください。

Is the new Cramer's rule algorithm really as good as LU?

1 回表示 (過去 30 日間)
Ben Petschel
Ben Petschel 2011 年 8 月 20 日
閉鎖済み: John D'Errico 2020 年 10 月 9 日
The Wikipedia article on Cramer's rule cites a recent paper that claims to have an O(n^3) algorithm:
Ken Habgood and Itamar Arel. 2010. Revisiting Cramer's rule for solving dense linear systems. In Proceedings of the 2010 Spring Simulation Multiconference (SpringSim '10). ACM, New York, NY, USA, Article 82
Available at:
http://dl.acm.org/citation.cfm?id=1878623
Unfortunately subscription is required so would anyone with access kindly be able to explain what is the main trick that is used?
In particular, how do they avoid calculating (n+1) determinants of O(n^3) complexity each, and how does the accuracy compare with LU/PLU?
  1 件のコメント
Gareth
Gareth 2013 年 3 月 1 日
They use Chio condensation - and a variant of this. The habgood thesis is online and contains the same info.

この質問は閉じられています。

回答 (0 件)

この質問は閉じられています。

タグ

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by