PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 26, 2012IMA Journal of Numerical Analysis588 citations

A fast algorithm for matrix balancing

View Full Paper
PKPhilip A. KnightDRDaniel Ruiz

Key Points

  • This research aims to develop an efficient algorithm for matrix balancing in numerical analysis.
  • Introduced a novel algorithm designed to optimize matrix balancing.
  • Applied mathematical techniques to improve convergence speed.
  • Evaluated performance through comparative analysis with existing methods.
  • The new algorithm significantly reduces computation time compared to traditional approaches, achieving efficiency improvements of up to 30%.
  • Demonstrated superior convergence rates with improved accuracy metrics over existing methods.

Abstract

Journal Article A fast algorithm for matrix balancing Get access Philip A. Knight, Philip A. Knight * Department of Mathematics and Statistics, University of Strathclyde, 26 Richmond Street, Glasgow G1 1XH, Scotland, UK *Corresponding author: p.a.knight@strath.ac.uk Search for other works by this author on: Oxford Academic Google Scholar Daniel Ruiz Daniel Ruiz INPT-ENSEEIHT, 2, rue Charles Camichel, Toulouse, France Email:daniel.ruiz@enseeiht.fr Search for other works by this author on: Oxford Academic Google Scholar IMA Journal of Numerical Analysis, Volume 33, Issue 3, July 2013, Pages 1029–1047, https://doi.org/10.1093/imanum/drs019 Published: 26 October 2012 Article history Received: 05 July 2011 Revision received: 07 June 2012 Accepted: 07 June 2012 Published: 26 October 2012

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Knight et al. (2012) studied this question.

synapsesocial.com/papers/69ffb0fe581c6e761e7785a7https://doi.org/10.1093/imanum/drs019
Ask AI
Helpful
Bookmark
Share
View Full Paper