Abstract
An approach to the construction of algorithms that are efficient for complexity and that calculate e-solutions to computation and applied mathematics problems is described in the first part of the present paper. This approach is applied for creation of i>T-efficient algorithms used to solve some classes of nonlinear integral equations, ordinary differential equations, and global optimization.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
