Programmirovanie algoritmov chislennykh metodov lineynoy algebry

V posobii rassmatrivayutsya chislennye metody resheniya zadach lineynoy algebry. Podrobno obsuzhdayutsya algoritmy etikh metodov i vse voprosy, svyazannye s ikh programmnoy realizatsiey, kak na yazykakh vysokogo urovnya, tak i v ramkakh svobodno rasprostranyaemogo matematicheskogo paketa Maxima. V knige privedeny metody resheniya sleduyushchikh zadach lineynoy algebry: opredelenie normy vektora i matritsy, mery obuslovlennosti matritsy; nakhozhdenie resheniya sistemy lineynykh uravneniy; vychislenie opredelitelya matritsy; opredelenie obratnoy matritsy; nakhozhdenie maksimal'nogo i minimal'nogo sobstvennykh chisel matritsy; nakhozhdenie kharakteristicheskogo mnogochlena matritsy; opredelenie vsekh sobstvennykh chisel i vektorov matritsy; vydelenie lineynogo i kvadratichnogo polinomov iz zadannogo polinoma; lokalizatsiya i posleduyushchee utochnenie korney polinoma. Kazhdaya tematicheskiy razdel zavershaetsya neskol'kimi voprosami i zadaniyami dlya samokontrolya. V zaklyuchenii privedeny temy zadaniy dlya praktikuma i prilozhenie s opisaniem nekotorykh vstroennykh komand paketa Maxima.