MATHLAB

MATHLAB

MATHLAB is a computer algebra system created in 1964 by Carl Engelman at MITRE and written in LISP.

"MATHLAB 68" was introduced in 1967[1] and became rather popular in university environments running on DECs PDP-6 and PDP-10 under TOPS-10 or TENEX. In 1969 this version was included in the DECUS user group's library (as 10-142) as royalty-free software.

Carl Engelman left MITRE for Symbolics where he contributed his expert knowledge in the development of Macsyma.

Features of MATHLAB 68

Abstract from DECUS Library Catalog:

MATHLAB is an on-line system providing machine aid for the mechanical symbolic processes encountered in analysis. It is capable of performing, automatically and symbolically, such common procedures as simplification, substitution, differentiation, polynomial factorization, indefinite integration, direct and inverse Laplace transforms, the solution of linear differential equations with constant coefficients, the solution of simultaneous linear equations, and the inversion of matrices. It also supplies fairly elaborate bookkeeping facilities appropriate to its on-line operation.

Print publications


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Computer algebra system — A computer algebra system (CAS) is a software program that facilitates symbolic mathematics. The core functionality of a CAS is manipulation of mathematical expressions in symbolic form. Contents 1 Symbolic manipulations 2 Additional capabilities …   Wikipedia

  • Система компьютерной алгебры — Для улучшения этой статьи желательно?: Найти и оформить в виде сносок ссылки на авторитетные источники, подтверждающие написанное. Добавить иллюстрации. Викифицировать список литературы, используя …   Википедия

  • Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… …   Wikipedia

  • Polylogarithm — Not to be confused with polylogarithmic. In mathematics, the polylogarithm (also known as Jonquière s function) is a special function Lis(z) that is defined by the infinite sum, or power series: It is in general not an elementary function, unlike …   Wikipedia

  • Rule of product — In combinatorics, the rule of product or multiplication principle is a basic counting principle (a.k.a. the fundamental principle of counting). Stated simply, it is the idea that if we have a ways of doing something and b ways of doing another… …   Wikipedia

  • Silicon Valley Technical Institute — (SVTI) is a provider of certificate training programs, located in the heart of Silicon Valley, in San Jose, California, United States. SVTI programs cover a wide range of topics in Elecronic Design, Semiconductor Technology, IC Packaging and Test …   Wikipedia

  • Níobeth — en el festival Viña Rock 2009, España (2009) Datos generales Origen Albacete, Esp …   Wikipedia Español

  • RFC 525 — MIT MATHLAB meets UCSB OLS an example of resource sharing Parrish, W.; Pickens, J.R. 1973 June 1; 10 p …   Acronyms

  • RFC 578 — Using MIT Mathlab MACSYMA from MIT DMS Muddle Bhushan, A.K.; Ryan, N.D. 1973 October 29; 13 p …   Acronyms

  • RFC 525 — MIT MATHLAB meets UCSB OLS an example of resource sharing Parrish, W.; Pickens, J.R. 1973 June 1; 10 p …   Acronyms von A bis Z

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”