Talaat S. El-Danaf scite author profile

In this paper, a relaxed gradient based algorithm for solving extended Sylvester-conjugate matrix equations by considering a relaxation parameter is proposed. The convergence analysis of the algorithm is investigated. Theoretical analysis shows that the new method converges under certain assumptions. A numerical example is given to illustrate effectiveness of the proposed method and to test its efficiency compared with an existing one.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Talaat S. El-Danaf

Parametric spline functions for the solution of the one time fractional Burgers’ equation

Numerical treatment for the modified burgers equation

A numerical solution of the Burgers’ equation using septic B-splines

A numerical solution of the Burgers’ equation using septic B-splines

A Relaxed Gradient Based Algorithm for Solving Extended Sylvester‐Conjugate Matrix Equations

Contact Info

Product

Resources

About