Angielski
Problem-solving is frequently viewed as the process of elaborating explicit closed-form solutions, and then using these solutions in numerical applications. This method is only able to consider a very limited set of problems that are simple enough to find such closed-form solutions. Unfortunately, most real-life problems in pure and applied sciences are not amenable to such a treatment. Numerical Algorithms: A Dining Guide deals with problems that are too complex to receive a closed-form mathematical solution. §Shifting the paradigm from formal calculus to numerical computation, the text makes it possible for the reader to§ discover how to escape the dictatorship of those particular cases that are simple enough to receive a closed-form solution, and thus gain the ability to solve complex, real-life problems;§ understand the principles behind recognized algorithms used in state-of-the-art numerical software; and§ learn the advantages and limitations of these algorithms, thus gaining the ability to choose which pre-existing bricks to assemble for solving a given problem and to make a critical assessment of their results. Numerical Algorithms: A Dining Guide will be of interest to engineers and researchers in pure and applied sciences who solve problems numerically with computers or supervise people doing so, and to students of both engineering and applied mathematics.
