186 relations: ABC ALGOL, Alexander Stepanov, Algebra, Algebra (disambiguation), Algebraic differential equation, Algebraic geometry, AMBIT, Anatol Slissenko, Applied mathematics, Arbitrary-precision arithmetic, Areas of mathematics, Astro Teller, Automated Mathematician, Automated theorem proving, Automatic calculation of particle interaction or decay, Automatic differentiation, Avalanche transistor, Bézout's theorem, Berlekamp's algorithm, Berlekamp–Zassenhaus algorithm, Bill Gosper, Bill Schelter, Bring radical, Calculator, Canonical form, CASC, Centre de Recherches Mathématiques, Charles-Eugène Delaunay, Charting application, Christoph Koutschan, Command history, Comparison of numerical analysis software, Complex torus, Computational complexity, Computational mathematics, Computational particle physics, Computational science, Computer algebra system, Computer mathematics, Computer Science and Engineering, Computer-assisted proof, Conway polynomial (finite fields), Cylindrical algebraic decomposition, Daniel Lazard, Dave Bayer, Davor Džalto, Dead code elimination, Differentiable neural computer, Digital physics, Dihydrogen cation, ..., Dima Grigoriev, Edward Ng, Elimination theory, Equations defining abelian varieties, Ernst Mayr (computer scientist), Euclidean domain, Experimental mathematics, Explicit substitution, Extended Euclidean algorithm, Factorization, Factorization of polynomials, Factorization of polynomials over finite fields, Faugère's F4 and F5 algorithms, FGLM algorithm, Fontana bridge, Franz Lisp, GiNaC, Glossary of areas of mathematics, Glossary of computer science, Gröbner basis, Gröbner fan, Grete Hermann, Hans Zassenhaus, Hash consing, Henri Cohen (number theorist), History of computing, History of mathematical notation, History of mathematics, Holonomic function, Ideal theory, Index of computing articles, International Symposium on Symbolic and Algebraic Computation, J Strother Moore, James A. D. W. Anderson, James H. Davenport, Jemris, Joachim von zur Gathen, John C. Slater, John Canny, John Chris Jones, John Fitch (computer scientist), Journal of Symbolic Computation, Kurt Mehlhorn, Lisp (programming language), List of abstract algebra topics, List of academic fields, List of arbitrary-precision arithmetic software, List of Massachusetts Institute of Technology alumni, List of open-source software for mathematics, List of University of Maryland, Baltimore County people, Low-rank approximation, Manuel Kauers, Maple (software), Martin Kreuzer, Mathcad, Matheass, Mathematical analysis, Mathematical and theoretical biology, Mathematical software, Mathematics, Mathomatic, MATLAB, Matthew T. Dickerson, Maxima (software), Michael Guy, Michael P. Barnett, MIR (computer), Modular arithmetic, Moss Sweedler, NaN, Nevanlinna Prize, Nondimensionalization, Numerical analysis, Numerical methods for ordinary differential equations, Ore algebra, Outline of academic disciplines, Outline of computer science, Outline of science, Paradigms of AI Programming: Case Studies in Common Lisp, Partial fraction decomposition, Per Enflo, Peter Paule, Petkovšek's algorithm, Pollard's kangaroo algorithm, Polynomial greatest common divisor, Privatization (computer programming), Programming domain, Pseudogroup, Pure (programming language), Pyspread, Ralph Griswold, Rational data type, Real number, Regular chain, Regular semi-algebraic system, RegularChains, Rekha R. Thomas, Research Institute for Symbolic Computation, Resultant, Risch algorithm, Roger A. Broucke, SageMath, Special functions, Square-free polynomial, Standard Template Library, Substitution (algebra), Subsumption lattice, Subtraction, Sum of radicals, Symbolic, Symbolic artificial intelligence, Symbolic execution, Symbolic integration, Symbolic simulation, Symbolic-numeric computation, SymbolicC++, SymPy, Teo Mora, Tevian Dray, Theoretical computer science, Theory of multiple intelligences, TI-BASIC, TI-Nspire series, Timeline of artificial intelligence, Timeline of scientific computing, Trance, Triangular decomposition, Ultrashort pulse, University of the Philippines College of Engineering, Value range analysis, Vladimir Gerdt, Wang Dongming (academic), Wheeler–Feynman absorber theory, William E. Caswell, Wolfram Language, 20th century in science. Expand index (136 more) »
ABC ALGOL
ABC ALGOL is an extension of the Algol 60 programming language with arbitrary data structures and user-defined operators, targeted for symbolic mathematics.
New!!: Computer algebra and ABC ALGOL · See more »
Alexander Stepanov
Alexander Alexandrovich Stepanov (Алекса́ндр Алекса́ндрович Степа́нов), born November 16, 1950 in Moscow, is a Russian computer programmer, best known as an advocate of generic programming and as the primary designer and implementer of the C++ Standard Template Library, which he started to develop around 1992 while employed at HP Labs.
New!!: Computer algebra and Alexander Stepanov · See more »
Algebra
Algebra (from Arabic "al-jabr", literally meaning "reunion of broken parts") is one of the broad parts of mathematics, together with number theory, geometry and analysis.
New!!: Computer algebra and Algebra · See more »
Algebra (disambiguation)
The word 'algebra' is used for various branches and structures of mathematics.
New!!: Computer algebra and Algebra (disambiguation) · See more »
Algebraic differential equation
In mathematics, an algebraic differential equation is a differential equation that can be expressed by means of differential algebra.
New!!: Computer algebra and Algebraic differential equation · See more »
Algebraic geometry
Algebraic geometry is a branch of mathematics, classically studying zeros of multivariate polynomials.
New!!: Computer algebra and Algebraic geometry · See more »
AMBIT
AMBIT is a historical programming language that was introduced by Carlos Christensen of Massachusetts Computer Associates in 1964 for symbolic computation.
New!!: Computer algebra and AMBIT · See more »
Anatol Slissenko
Anatol Slissenko (Анатолий Олесьевич Слисенко) (born August 15, 1941) is a Soviet, Russian and French mathematician and computer scientist.
New!!: Computer algebra and Anatol Slissenko · See more »
Applied mathematics
Applied mathematics is the application of mathematical methods by different fields such as science, engineering, business, computer science, and industry.
New!!: Computer algebra and Applied mathematics · See more »
Arbitrary-precision arithmetic
In computer science, arbitrary-precision arithmetic, also called bignum arithmetic, multiple-precision arithmetic, or sometimes infinite-precision arithmetic, indicates that calculations are performed on numbers whose digits of precision are limited only by the available memory of the host system.
New!!: Computer algebra and Arbitrary-precision arithmetic · See more »
Areas of mathematics
Mathematics encompasses a growing variety and depth of subjects over history, and comprehension requires a system to categorize and organize the many subjects into more general areas of mathematics.
New!!: Computer algebra and Areas of mathematics · See more »
Astro Teller
Astro Teller (born Eric Teller; 29 May 1970) is an entrepreneur, scientist, and author, with expertise in the field of intelligent technology.
New!!: Computer algebra and Astro Teller · See more »
Automated Mathematician
The Automated Mathematician (AM) is one of the earliest successful discovery systems.
New!!: Computer algebra and Automated Mathematician · See more »
Automated theorem proving
Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving mathematical theorems by computer programs.
New!!: Computer algebra and Automated theorem proving · See more »
Automatic calculation of particle interaction or decay
The automatic calculation of particle interaction or decay is part of the computational particle physics branch.
New!!: Computer algebra and Automatic calculation of particle interaction or decay · See more »
Automatic differentiation
In mathematics and computer algebra, automatic differentiation (AD), also called algorithmic differentiation or computational differentiation, is a set of techniques to numerically evaluate the derivative of a function specified by a computer program.
New!!: Computer algebra and Automatic differentiation · See more »
Avalanche transistor
An avalanche transistor is a bipolar junction transistor designed for operation in the region of its collector-current/collector-to-emitter voltage characteristics beyond the collector-to-emitter breakdown voltage, called avalanche breakdown region.
New!!: Computer algebra and Avalanche transistor · See more »
Bézout's theorem
Bézout's theorem is a statement in algebraic geometry concerning the number of common points, or intersection points, of two plane algebraic curves which do not share a common component (that is, which do not have infinitely many common points).
New!!: Computer algebra and Bézout's theorem · See more »
Berlekamp's algorithm
In mathematics, particularly computational algebra, Berlekamp's algorithm is a well-known method for factoring polynomials over finite fields (also known as Galois fields).
New!!: Computer algebra and Berlekamp's algorithm · See more »
Berlekamp–Zassenhaus algorithm
In mathematics, in particular in computational algebra, the Berlekamp–Zassenhaus algorithm is an algorithm for factoring polynomials over the integers, named after Elwyn Berlekamp and Hans Zassenhaus.
New!!: Computer algebra and Berlekamp–Zassenhaus algorithm · See more »
Bill Gosper
Ralph William Gosper Jr. (born April 26, 1943), known as Bill Gosper, is an American mathematician and programmer.
New!!: Computer algebra and Bill Gosper · See more »
Bill Schelter
William Frederick Schelter (1947 – July 30, 2001) was a professor of mathematics at The University of Texas at Austin and a Lisp developer and programmer.
New!!: Computer algebra and Bill Schelter · See more »
Bring radical
In algebra, the Bring radical or ultraradical of a real number a is the unique real root of the polynomial The Bring radical of a complex number a is either any of the five roots of the above polynomial (it is thus multi-valued), or a specific root, which is usually chosen in order that the Bring radical is a function of a, which is real-valued when a is real, and is an analytic function in a neighborhood of the real line.
New!!: Computer algebra and Bring radical · See more »
Calculator
An electronic calculator is typically a portable electronic device used to perform calculations, ranging from basic arithmetic to complex mathematics.
New!!: Computer algebra and Calculator · See more »
Canonical form
In mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical expression.
New!!: Computer algebra and Canonical form · See more »
CASC
CASC or Casc may refer to.
New!!: Computer algebra and CASC · See more »
Centre de Recherches Mathématiques
The Centre de Recherches Mathématiques (CRM) is the first mathematical research institute in Canada.
New!!: Computer algebra and Centre de Recherches Mathématiques · See more »
Charles-Eugène Delaunay
Charles-Eugène Delaunay (9 April 1816 – 5 August 1872) was a French astronomer and mathematician.
New!!: Computer algebra and Charles-Eugène Delaunay · See more »
Charting application
A charting application is a computer program that is used to create a graphical representation (a chart) based on some non-graphical data that is entered by a user, most often through a spreadsheet application, but also through a dedicated specific scientific application (such as through a symbolic mathematics computing system, or a proprietary data collection application), or using an online spreadsheet service.
New!!: Computer algebra and Charting application · See more »
Christoph Koutschan
Christoph Koutschan is a German mathematician and computer scientist.
New!!: Computer algebra and Christoph Koutschan · See more »
Command history
Command history is a feature in many operating system shells, computer algebra programs, and other software that allows the user to recall, edit and rerun previous commands.
New!!: Computer algebra and Command history · See more »
Comparison of numerical analysis software
The following tables provide a comparison of numerical analysis software.
New!!: Computer algebra and Comparison of numerical analysis software · See more »
Complex torus
In mathematics, a complex torus is a particular kind of complex manifold M whose underlying smooth manifold is a torus in the usual sense (i.e. the cartesian product of some number N circles).
New!!: Computer algebra and Complex torus · See more »
Computational complexity
In computer science, the computational complexity, or simply complexity of an algorithm is the amount of resources required for running it.
New!!: Computer algebra and Computational complexity · See more »
Computational mathematics
Computational mathematics may refer to two different aspect of the relation between computing and mathematics.
New!!: Computer algebra and Computational mathematics · See more »
Computational particle physics
Computational particle physics refers to the methods and computing tools developed in and used by particle physics research.
New!!: Computer algebra and Computational particle physics · See more »
Computational science
Computational science (also scientific computing or scientific computation (SC)) is a rapidly growing multidisciplinary field that uses advanced computing capabilities to understand and solve complex problems.
New!!: Computer algebra and Computational science · See more »
Computer algebra system
A computer algebra system (CAS) is any mathematical software with the ability to manipulate mathematical expressions in a way similar to the traditional manual computations of mathematicians and scientists.
New!!: Computer algebra and Computer algebra system · See more »
Computer mathematics
Computer mathematics may refer to.
New!!: Computer algebra and Computer mathematics · See more »
Computer Science and Engineering
Computer science and engineering (CSE) is an academic program at some universities that integrates the fields of computer engineering and computer science.
New!!: Computer algebra and Computer Science and Engineering · See more »
Computer-assisted proof
A computer-assisted proof is a mathematical proof that has been at least partially generated by computer.
New!!: Computer algebra and Computer-assisted proof · See more »
Conway polynomial (finite fields)
In mathematics, the Conway polynomial Cp,n for the finite field Fpn is a particular irreducible polynomial of degree n over Fp that can be used to define a standard representation of Fpn as a splitting field of Fp.
New!!: Computer algebra and Conway polynomial (finite fields) · See more »
Cylindrical algebraic decomposition
In mathematics, cylindrical algebraic decomposition (CAD) is a notion, and an algorithm to compute it, which are fundamental for computer algebra and real algebraic geometry.
New!!: Computer algebra and Cylindrical algebraic decomposition · See more »
Daniel Lazard
Daniel Lazard (born December 10, 1941) is a French mathematician and computer scientist.
New!!: Computer algebra and Daniel Lazard · See more »
Dave Bayer
David Allen Bayer (born November 29, 1955) is an American mathematician known for his contributions in algebra and symbolic computation and for his consulting work in the movie industry.
New!!: Computer algebra and Dave Bayer · See more »
Davor Džalto
Prof.
New!!: Computer algebra and Davor Džalto · See more »
Dead code elimination
In compiler theory, dead code elimination (also known as DCE, dead code removal, dead code stripping, or dead code strip) is a compiler optimization to remove code which does not affect the program results.
New!!: Computer algebra and Dead code elimination · See more »
Differentiable neural computer
A differentiable neural computer (DNC) is a recurrent artificial neural network architecture with an autoassociative memory.
New!!: Computer algebra and Differentiable neural computer · See more »
Digital physics
In physics and cosmology, digital physics (also referred to as digital ontology or digital philosophy) is a collection of theoretical perspectives based on the premise that the universe is describable by information.
New!!: Computer algebra and Digital physics · See more »
Dihydrogen cation
The hydrogen molecular ion, dihydrogen cation, or, is the simplest molecular ion.
New!!: Computer algebra and Dihydrogen cation · See more »
Dima Grigoriev
Dima Grigoriev (Dmitry Grigoryev) (born 10 May 1954) is a mathematician.
New!!: Computer algebra and Dima Grigoriev · See more »
Edward Ng
Edward W Ng (born 1939 Hong Kong), Chinese name 伍煒國 is an American Applied mathematician who has also held the positions of senior scientist, senior engineer and technical manager in the U.S. Space Program.
New!!: Computer algebra and Edward Ng · See more »
Elimination theory
In commutative algebra and algebraic geometry, elimination theory is the classical name for algorithmic approaches to eliminating some variables between polynomials of several variables, in order to solve systems of polynomial equations.
New!!: Computer algebra and Elimination theory · See more »
Equations defining abelian varieties
In mathematics, the concept of abelian variety is the higher-dimensional generalization of the elliptic curve.
New!!: Computer algebra and Equations defining abelian varieties · See more »
Ernst Mayr (computer scientist)
Ernst Wilhelm Mayr (born May 18, 1950) is a German computer scientist and mathematician.
New!!: Computer algebra and Ernst Mayr (computer scientist) · See more »
Euclidean domain
In mathematics, more specifically in ring theory, a Euclidean domain (also called a Euclidean ring) is an integral domain that can be endowed with a Euclidean function which allows a suitable generalization of the Euclidean division of the integers.
New!!: Computer algebra and Euclidean domain · See more »
Experimental mathematics
Experimental mathematics is an approach to mathematics in which computation is used to investigate mathematical objects and identify properties and patterns.
New!!: Computer algebra and Experimental mathematics · See more »
Explicit substitution
In computer science, lambda calculi are said to have explicit substitutions if they pay special attention to the formalization of the process of substitution.
New!!: Computer algebra and Explicit substitution · See more »
Extended Euclidean algorithm
In arithmetic and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, and computes, in addition to the greatest common divisor of integers a and b, also the coefficients of Bézout's identity, which are integers x and y such that This is a certifying algorithm, because the gcd is the only number that can simultaneously satisfy this equation and divide the inputs.
New!!: Computer algebra and Extended Euclidean algorithm · See more »
Factorization
In mathematics, factorization (also factorisation in some forms of British English) or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind.
New!!: Computer algebra and Factorization · See more »
Factorization of polynomials
In mathematics and computer algebra, factorization of polynomials or polynomial factorization is the process of expressing a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same domain.
New!!: Computer algebra and Factorization of polynomials · See more »
Factorization of polynomials over finite fields
In mathematics and computer algebra the factorization of a polynomial consists of decomposing it into a product of irreducible factors.
New!!: Computer algebra and Factorization of polynomials over finite fields · See more »
Faugère's F4 and F5 algorithms
In computer algebra, the Faugère F4 algorithm, by Jean-Charles Faugère, computes the Gröbner basis of an ideal of a multivariate polynomial ring.
New!!: Computer algebra and Faugère's F4 and F5 algorithms · See more »
FGLM algorithm
FGLM is one of the main algorithms in computer algebra, named after its designers, Faugère, Gianni, Lazard and Mora.
New!!: Computer algebra and FGLM algorithm · See more »
Fontana bridge
A Fontana bridge is a type of bridge circuit that implements a wide frequency band voltage-to-current converter.
New!!: Computer algebra and Fontana bridge · See more »
Franz Lisp
In computer programming, Franz Lisp was a Lisp system written at UC Berkeley by the students of Professor Richard J. Fateman, based largely on Maclisp and distributed with the Berkeley Software Distribution (BSD) for the Digital Equipment Corp (DEC) VAX.
New!!: Computer algebra and Franz Lisp · See more »
GiNaC
GiNaC is a free computer algebra system released under the GNU General Public License.
New!!: Computer algebra and GiNaC · See more »
Glossary of areas of mathematics
This is a glossary of terms that are or have been considered areas of study in mathematics.
New!!: Computer algebra and Glossary of areas of mathematics · See more »
Glossary of computer science
Most of the terms listed in Wikipedia glossaries are already defined and explained within Wikipedia itself.
New!!: Computer algebra and Glossary of computer science · See more »
Gröbner basis
In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring over a field.
New!!: Computer algebra and Gröbner basis · See more »
Gröbner fan
In computer algebra, the Gröbner fan of an ideal in the ring of polynomials is a concept in the theory of Gröbner bases.
New!!: Computer algebra and Gröbner fan · See more »
Grete Hermann
Grete (Henry-)Hermann (March 2, 1901 – April 15, 1984) was a German mathematician and philosopher noted for her work in mathematics, physics, philosophy and education.
New!!: Computer algebra and Grete Hermann · See more »
Hans Zassenhaus
Hans Julius Zassenhaus (28 May 1912 – 21 November 1991) was a German mathematician, known for work in many parts of abstract algebra, and as a pioneer of computer algebra.
New!!: Computer algebra and Hans Zassenhaus · See more »
Hash consing
In computer science, particularly in functional programming, hash consing is a technique used to share values that are structurally equal.
New!!: Computer algebra and Hash consing · See more »
Henri Cohen (number theorist)
Henri Cohen (born 8 June 1947) is a number theorist, and a Professor at the University of Bordeaux.
New!!: Computer algebra and Henri Cohen (number theorist) · See more »
History of computing
The history of computing is longer than the history of computing hardware and modern computing technology and includes the history of methods intended for pen and paper or for chalk and slate, with or without the aid of tables.
New!!: Computer algebra and History of computing · See more »
History of mathematical notation
The history of mathematical notation includes the commencement, progress, and cultural diffusion of mathematical symbols and the conflict of the methods of notation confronted in a notation's move to popularity or inconspicuousness.
New!!: Computer algebra and History of mathematical notation · See more »
History of mathematics
The area of study known as the history of mathematics is primarily an investigation into the origin of discoveries in mathematics and, to a lesser extent, an investigation into the mathematical methods and notation of the past.
New!!: Computer algebra and History of mathematics · See more »
Holonomic function
In mathematics, and more specifically in analysis, a holonomic function is a smooth function in several variables that is a solution of a system of linear homogeneous differential equations with polynomial coefficients and satisfies a suitable dimension condition in terms of D-modules theory.
New!!: Computer algebra and Holonomic function · See more »
Ideal theory
In mathematics, ideal theory is the theory of ideals in commutative rings; and is the precursor name for the contemporary subject of commutative algebra.
New!!: Computer algebra and Ideal theory · See more »
Index of computing articles
Originally, the word computing was synonymous with counting and calculating, and the science and technology of mathematical calculations.
New!!: Computer algebra and Index of computing articles · See more »
International Symposium on Symbolic and Algebraic Computation
ISSAC, the International Symposium on Symbolic and Algebraic Computation, is an academic conference in the field of computer algebra.
New!!: Computer algebra and International Symposium on Symbolic and Algebraic Computation · See more »
J Strother Moore
J Strother Moore (his first name is the alphabetic character "J" – not an abbreviated "J.") is a computer scientist, and he is a co-developer of the Boyer–Moore string search algorithm, Boyer–Moore majority vote algorithm, and the Boyer–Moore automated theorem prover, Nqthm.
New!!: Computer algebra and J Strother Moore · See more »
James A. D. W. Anderson
James Arthur Dean Wallace Anderson Known for James Anderson is an academic staff member in the School of Systems Engineering at the University of Reading, England.
New!!: Computer algebra and James A. D. W. Anderson · See more »
James H. Davenport
James Harold Davenport (born 15 October 1953) is a British computer scientist who works in computer algebra.
New!!: Computer algebra and James H. Davenport · See more »
Jemris
Jemris is an open source MRI sequence design and simulation framework written in C++.
New!!: Computer algebra and Jemris · See more »
Joachim von zur Gathen
Joachim von zur Gathen (born 1950) is a German mathematician and computer scientist.
New!!: Computer algebra and Joachim von zur Gathen · See more »
John C. Slater
John Clarke Slater (December 22, 1900 – July 25, 1976) was a noted American physicist who made major contributions to the theory of the electronic structure of atoms, molecules and solids.
New!!: Computer algebra and John C. Slater · See more »
John Canny
John F. Canny (born in 1958) is an Australian computer scientist, and Paul E Jacobs and Stacy Jacobs Distinguished Professor of Engineering in the Computer Science Department of the University of California, Berkeley.
New!!: Computer algebra and John Canny · See more »
John Chris Jones
John Christopher Jones (John Chris Jones) is a Welsh designer.
New!!: Computer algebra and John Chris Jones · See more »
John Fitch (computer scientist)
John Peter Fitch (also known as John ffitch) is a computer scientist, mathematician and composer, who has worked with relativity, planetary astronomy, computer algebra and Lisp.
New!!: Computer algebra and John Fitch (computer scientist) · See more »
Journal of Symbolic Computation
The Journal of Symbolic Computation is a peer-reviewed monthly scientific journal covering all aspects of symbolic computation published by Academic Press and then by Elsevier.
New!!: Computer algebra and Journal of Symbolic Computation · See more »
Kurt Mehlhorn
Kurt Mehlhorn (born 29 August 1949) is a German theoretical computer scientist.
New!!: Computer algebra and Kurt Mehlhorn · See more »
Lisp (programming language)
Lisp (historically, LISP) is a family of computer programming languages with a long history and a distinctive, fully parenthesized prefix notation.
New!!: Computer algebra and Lisp (programming language) · See more »
List of abstract algebra topics
Abstract algebra is the subject area of mathematics that studies algebraic structures, such as groups, rings, fields, modules, vector spaces, and algebras.
New!!: Computer algebra and List of abstract algebra topics · See more »
List of academic fields
The following outline is provided as an overview of an topical guide to academic disciplines: An academic discipline or field of study is known as a branch of knowledge.
New!!: Computer algebra and List of academic fields · See more »
List of arbitrary-precision arithmetic software
This article lists libraries, applications and other software which enable or support arbitrary-precision arithmetic.
New!!: Computer algebra and List of arbitrary-precision arithmetic software · See more »
List of Massachusetts Institute of Technology alumni
This list of Massachusetts Institute of Technology alumni includes students who studied as undergraduates or graduate students at MIT's School of Engineering; School of Science; MIT Sloan School of Management; School of Humanities, Arts, and Social Sciences; School of Architecture and Planning; or Whitaker College of Health Sciences.
New!!: Computer algebra and List of Massachusetts Institute of Technology alumni · See more »
List of open-source software for mathematics
This is a list of open-source software to be used for high-order mathematical calculations.
New!!: Computer algebra and List of open-source software for mathematics · See more »
List of University of Maryland, Baltimore County people
No description.
New!!: Computer algebra and List of University of Maryland, Baltimore County people · See more »
Low-rank approximation
In mathematics, low-rank approximation is a minimization problem, in which the cost function measures the fit between a given matrix (the data) and an approximating matrix (the optimization variable), subject to a constraint that the approximating matrix has reduced rank.
New!!: Computer algebra and Low-rank approximation · See more »
Manuel Kauers
Manuel Kauers (born 20 February 1979 in Lahnstein, Germany) is a German mathematician and computer scientist.
New!!: Computer algebra and Manuel Kauers · See more »
Maple (software)
Maple is a symbolic and numeric computing environment, and is also a multi-paradigm programming language.
New!!: Computer algebra and Maple (software) · See more »
Martin Kreuzer
Martin Kreuzer (born 15 July 1962, Ihrlerstein, Germany) is a German Grandmaster of Correspondence Chess and a Mathematics professor.
New!!: Computer algebra and Martin Kreuzer · See more »
Mathcad
Mathcad is computer software primarily intended for the verification, validation, documentation and re-use of engineering calculations.
New!!: Computer algebra and Mathcad · See more »
Matheass
MatheAss (former Math-Assist) is a computer program for numerical solutions in school mathematics and functions in some points similar to Microsoft Mathematics.
New!!: Computer algebra and Matheass · See more »
Mathematical analysis
Mathematical analysis is the branch of mathematics dealing with limits and related theories, such as differentiation, integration, measure, infinite series, and analytic functions.
New!!: Computer algebra and Mathematical analysis · See more »
Mathematical and theoretical biology
Mathematical and theoretical biology is a branch of biology which employs theoretical analysis, mathematical models and abstractions of the living organisms to investigate the principles that govern the structure, development and behavior of the systems, as opposed to experimental biology which deals with the conduction of experiments to prove and validate the scientific theories.
New!!: Computer algebra and Mathematical and theoretical biology · See more »
Mathematical software
Mathematical software is software used to model, analyze or calculate numeric, symbolic or geometric data.
New!!: Computer algebra and Mathematical software · See more »
Mathematics
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
New!!: Computer algebra and Mathematics · See more »
Mathomatic
Mathomatic is a free, portable, general-purpose computer algebra system (CAS) that can symbolically solve, simplify, combine, and compare algebraic equations, and can perform complex number, modular, and polynomial arithmetic, along with standard arithmetic.
New!!: Computer algebra and Mathomatic · See more »
MATLAB
MATLAB (matrix laboratory) is a multi-paradigm numerical computing environment and proprietary programming language developed by MathWorks.
New!!: Computer algebra and MATLAB · See more »
Matthew T. Dickerson
Matthew T. Dickerson is a professor of computer science at Middlebury College in Vermont, at Middlebury College, retrieved 2009-11-19.
New!!: Computer algebra and Matthew T. Dickerson · See more »
Maxima (software)
Maxima is a computer algebra system (CAS) based on a 1982 version of Macsyma.
New!!: Computer algebra and Maxima (software) · See more »
Michael Guy
Michael J. T. Guy (born c.1942) is a British computer scientist and mathematician.
New!!: Computer algebra and Michael Guy · See more »
Michael P. Barnett
Michael Peter Barnett (24 March 1929 – 13 March 2012) was a British theoretical chemist and computer scientist.
New!!: Computer algebra and Michael P. Barnett · See more »
MIR (computer)
The MIR series of early Soviet personal computers was developed from 1965 (MIR), 1968 (MIR-1) to 1969 (MIR-2) in a group headed by Victor Glushkov.
New!!: Computer algebra and MIR (computer) · See more »
Modular arithmetic
In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" upon reaching a certain value—the modulus (plural moduli).
New!!: Computer algebra and Modular arithmetic · See more »
Moss Sweedler
Moss Eisenberg Sweedler (29 April 1942. Brooklyn) is an American mathematician, known for Sweedler's Hopf algebra, measuring coalgebras, and his proof, with Harry Prince Allen, of a conjecture of Nathan Jacobson.
New!!: Computer algebra and Moss Sweedler · See more »
NaN
In computing, NaN, standing for not a number, is a numeric data type value representing an undefined or unrepresentable value, especially in floating-point calculations.
New!!: Computer algebra and NaN · See more »
Nevanlinna Prize
The Rolf Nevanlinna Prize (named in honor of Rolf Nevanlinna) is awarded once every 4 years at the International Congress of Mathematicians, for outstanding contributions in Mathematical Aspects of Information Sciences including.
New!!: Computer algebra and Nevanlinna Prize · See more »
Nondimensionalization
Nondimensionalization is the partial or full removal of units from an equation involving physical quantities by a suitable substitution of variables.
New!!: Computer algebra and Nondimensionalization · See more »
Numerical analysis
Numerical analysis is the study of algorithms that use numerical approximation (as opposed to general symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics).
New!!: Computer algebra and Numerical analysis · See more »
Numerical methods for ordinary differential equations
Numerical methods for ordinary differential equations are methods used to find numerical approximations to the solutions of ordinary differential equations (ODEs).
New!!: Computer algebra and Numerical methods for ordinary differential equations · See more »
Ore algebra
In computer algebra, an Ore algebra is a special kind of iterated Ore extension that can be used to represent linear functional operators, including linear differential and/or recurrence operators.
New!!: Computer algebra and Ore algebra · See more »
Outline of academic disciplines
An academic discipline or field of study is a branch of knowledge that is taught and researched as part of higher education.
New!!: Computer algebra and Outline of academic disciplines · See more »
Outline of computer science
Computer science (also called computing science) is the study of the theoretical foundations of information and computation and their implementation and application in computer systems.
New!!: Computer algebra and Outline of computer science · See more »
Outline of science
The following outline is provided as a topical overview of science: Science – the systematic effort of acquiring knowledge—through observation and experimentation coupled with logic and reasoning to find out what can be proved or not proved—and the knowledge thus acquired.
New!!: Computer algebra and Outline of science · See more »
Paradigms of AI Programming: Case Studies in Common Lisp
Paradigms of AI Programming: Case Studies in Common Lisp is a well-known programming book by Peter Norvig about artificial intelligence programming using Common Lisp.
New!!: Computer algebra and Paradigms of AI Programming: Case Studies in Common Lisp · See more »
Partial fraction decomposition
In algebra, the partial fraction decomposition or partial fraction expansion of a rational function (that is, a fraction such that the numerator and the denominator are both polynomials) is the operation that consists in expressing the fraction as a sum of a polynomial (possibly zero) and one or several fractions with a simpler denominator.
New!!: Computer algebra and Partial fraction decomposition · See more »
Per Enflo
Per H. Enflo (born 20 May 1944) is a Swedish mathematician working primarily in functional analysis, a field in which he solved problems that had been considered fundamental.
New!!: Computer algebra and Per Enflo · See more »
Peter Paule
Peter Paule is an Austrian mathematician who works in symbolic computation and its connections to combinatorics, number theory, and special functions.
New!!: Computer algebra and Peter Paule · See more »
Petkovšek's algorithm
Petkovšek's algorithm is a computer algebra algorithm that computes a basis of hypergeometric terms solution of its input linear recurrence equation with polynomial coefficients.
New!!: Computer algebra and Petkovšek's algorithm · See more »
Pollard's kangaroo algorithm
In computational number theory and computational algebra, Pollard's kangaroo algorithm (also Pollard's lambda algorithm, see Naming below) is an algorithm for solving the discrete logarithm problem.
New!!: Computer algebra and Pollard's kangaroo algorithm · See more »
Polynomial greatest common divisor
In algebra, the greatest common divisor (frequently abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a factor of both the two original polynomials.
New!!: Computer algebra and Polynomial greatest common divisor · See more »
Privatization (computer programming)
Privatization is a technique used in shared-memory programming to enable parallelism, by removing dependencies that occur across different threads in a parallel program.
New!!: Computer algebra and Privatization (computer programming) · See more »
Programming domain
A programming domain defines a specific kind of use for a programming language.
New!!: Computer algebra and Programming domain · See more »
Pseudogroup
In mathematics, a pseudogroup is an extension of the group concept, but one that grew out of the geometric approach of Sophus Lie, rather than out of abstract algebra (such as quasigroup, for example).
New!!: Computer algebra and Pseudogroup · See more »
Pure (programming language)
Pure, successor to the equational language Q, is a dynamically typed, functional programming language based on term rewriting.
New!!: Computer algebra and Pure (programming language) · See more »
Pyspread
Pyspread is a non-traditional spreadsheet.
New!!: Computer algebra and Pyspread · See more »
Ralph Griswold
Ralph E. Griswold (May 19, 1934, Modesto, CA – October 4, 2006, Tucson, AZ) was a computer scientist known for his research into high-level programming languages and symbolic computation.
New!!: Computer algebra and Ralph Griswold · See more »
Rational data type
Some programming languages provide a built-in (primitive) rational data type to represent rational numbers like 1/3 and -11/17 without rounding, and to do arithmetic on them.
New!!: Computer algebra and Rational data type · See more »
Real number
In mathematics, a real number is a value of a continuous quantity that can represent a distance along a line.
New!!: Computer algebra and Real number · See more »
Regular chain
In computer algebra, a regular chain is a particular kind of triangular set in a multivariate polynomial ring over a field.
New!!: Computer algebra and Regular chain · See more »
Regular semi-algebraic system
In computer algebra, a regular semi-algebraic system is a particular kind of triangular system of multivariate polynomials over a real closed field.
New!!: Computer algebra and Regular semi-algebraic system · See more »
RegularChains
The RegularChains package in the computer algebra software package Maple is a collection of commands for solving systems of polynomial equations, inequations and inequalities symbolically.
New!!: Computer algebra and RegularChains · See more »
Rekha R. Thomas
Rekha Rachel Thomas is a mathematician and operations researcher.
New!!: Computer algebra and Rekha R. Thomas · See more »
Research Institute for Symbolic Computation
The Research Institute for Symbolic Computation (RISC Linz) is a leading research institute in the area of symbolic computation, including automated theorem proving and computer algebra.
New!!: Computer algebra and Research Institute for Symbolic Computation · See more »
Resultant
In mathematics, the resultant of two polynomials is a polynomial expression of their coefficients, which is equal to zero if and only if the polynomials have a common root (possibly in a field extension), or, equivalently, a common factor (over their field of coefficients).
New!!: Computer algebra and Resultant · See more »
Risch algorithm
In symbolic computation (or computer algebra), at the intersection of mathematics and computer science, the Risch algorithm is an algorithm for indefinite integration.
New!!: Computer algebra and Risch algorithm · See more »
Roger A. Broucke
Roger A. Broucke (March 25, 1932 – June 21, 2005) was an aerospace engineer known for his solutions to the three-body problem.
New!!: Computer algebra and Roger A. Broucke · See more »
SageMath
SageMath (previously Sage or SAGE, "System for Algebra and Geometry Experimentation") is a computer algebra system with features covering many aspects of mathematics, including algebra, combinatorics, graph theory, numerical analysis, number theory, calculus and statistics.
New!!: Computer algebra and SageMath · See more »
Special functions
Special functions are particular mathematical functions which have more or less established names and notations due to their importance in mathematical analysis, functional analysis, physics, or other applications.
New!!: Computer algebra and Special functions · See more »
Square-free polynomial
In mathematics, a square-free polynomial is a polynomial defined over a field (or more generally, a unique factorization domain) that does not have as a factor any square of a non-unit factor.
New!!: Computer algebra and Square-free polynomial · See more »
Standard Template Library
The Standard Template Library (STL) is a software library for the C++ programming language that influenced many parts of the C++ Standard Library.
New!!: Computer algebra and Standard Template Library · See more »
Substitution (algebra)
In algebra, the operation of substitution can be applied in various contexts involving formal objects containing symbols (often called variables or indeterminates); the operation consists of systematically replacing occurrences of some symbol by a given value.
New!!: Computer algebra and Substitution (algebra) · See more »
Subsumption lattice
A subsumption lattice is a mathematical structure used in theoretical background of automated theorem proving and other symbolic computation applications.
New!!: Computer algebra and Subsumption lattice · See more »
Subtraction
Subtraction is an arithmetic operation that represents the operation of removing objects from a collection.
New!!: Computer algebra and Subtraction · See more »
Sum of radicals
In computational complexity theory, there is an open problem of whether some information about a sum of radicals may be computed in polynomial time depending on the input size, i.e., in the number of bits necessary to represent this sum.
New!!: Computer algebra and Sum of radicals · See more »
Symbolic
Symbolic may refer to.
New!!: Computer algebra and Symbolic · See more »
Symbolic artificial intelligence
Symbolic artificial intelligence is the term for the collection of all methods in artificial intelligence research that are based on high-level "symbolic" (human-readable) representations of problems, logic and search.
New!!: Computer algebra and Symbolic artificial intelligence · See more »
Symbolic execution
In computer science, symbolic execution (also symbolic evaluation) is a means of analyzing a program to determine what inputs cause each part of a program to execute.
New!!: Computer algebra and Symbolic execution · See more »
Symbolic integration
In calculus, symbolic integration is the problem of finding a formula for the antiderivative, or indefinite integral, of a given function f(x), i.e. to find a differentiable function F(x) such that This is also denoted.
New!!: Computer algebra and Symbolic integration · See more »
Symbolic simulation
In computer science, a simulation is a computation of the execution of some appropriately modelled state-transition system.
New!!: Computer algebra and Symbolic simulation · See more »
Symbolic-numeric computation
In mathematics and computer science, symbolic-numeric computation is the use of software that combines symbolic and numeric methods to solve problems.
New!!: Computer algebra and Symbolic-numeric computation · See more »
SymbolicC++
SymbolicC++ is a general purpose computer algebra system embedded in the programming language C++.
New!!: Computer algebra and SymbolicC++ · See more »
SymPy
SymPy is a Python library for symbolic computation.
New!!: Computer algebra and SymPy · See more »
Teo Mora
Ferdinando 'Teo' Mora is an Italian mathematician, and since 1990, a professor of algebra at the University of Genoa.
New!!: Computer algebra and Teo Mora · See more »
Tevian Dray
Tevian Dray (born March 17, 1956) is an American mathematician who has worked in general relativity, mathematical physics, geometry, and both science and mathematics education.
New!!: Computer algebra and Tevian Dray · See more »
Theoretical computer science
Theoretical computer science, or TCS, is a subset of general computer science and mathematics that focuses on more mathematical topics of computing and includes the theory of computation.
New!!: Computer algebra and Theoretical computer science · See more »
Theory of multiple intelligences
The theory of multiple intelligences differentiates human intelligence into specific 'modalities', rather than seeing intelligence as dominated by a single general ability.
New!!: Computer algebra and Theory of multiple intelligences · See more »
TI-BASIC
TI-BASIC is the official name of a BASIC-like language built into Texas Instruments (TI)'s graphing calculators, including the TI-83 series, TI-84 Plus series, TI-89 series, TI-92 series (including Voyage 200), TI-73, and TI-Nspire.
New!!: Computer algebra and TI-BASIC · See more »
TI-Nspire series
The TI-Nspire product line is a series of graphing calculators developed by Texas Instruments.
New!!: Computer algebra and TI-Nspire series · See more »
Timeline of artificial intelligence
This is a timeline of artificial intelligence.
New!!: Computer algebra and Timeline of artificial intelligence · See more »
Timeline of scientific computing
The following is a timeline of scientific computing, also known as computational science.
New!!: Computer algebra and Timeline of scientific computing · See more »
Trance
Trance denotes any state of awareness or consciousness other than normal waking consciousness.
New!!: Computer algebra and Trance · See more »
Triangular decomposition
In computer algebra, a triangular decomposition of a polynomial system is a set of simpler polynomial systems such that a point is a solution of if and only if it is a solution of one of the systems.
New!!: Computer algebra and Triangular decomposition · See more »
Ultrashort pulse
In optics, an ultrashort pulse of light is an electromagnetic pulse whose time duration is of the order of a picosecond (10−12 second) or less.
New!!: Computer algebra and Ultrashort pulse · See more »
University of the Philippines College of Engineering
The College of Engineering of the University of the Philippines Diliman is the largest degree-granting unit in the U.P. System in terms of student population.
New!!: Computer algebra and University of the Philippines College of Engineering · See more »
Value range analysis
In computing, in particular compiler construction, value range analysis is a type of data flow analysis that tracks the range (interval) of values that a numeric variable can take on at each point of a program's execution.
New!!: Computer algebra and Value range analysis · See more »
Vladimir Gerdt
Vladimir P. Gerdt (born January 21, 1947) is a Russian mathematician and a full professor at the Joint Institute for Nuclear Research (JINR) where he is the head of the Group of Algebraic and Quantum Computations.
New!!: Computer algebra and Vladimir Gerdt · See more »
Wang Dongming (academic)
Wang Dongming (born July 1961 in Anhui, China) is Research Director (Directeur de Recherche) at the French National Center for Scientific Research (Centre National de la Recherche Scientifique, CNRS).
New!!: Computer algebra and Wang Dongming (academic) · See more »
Wheeler–Feynman absorber theory
The Wheeler–Feynman absorber theory (also called the Wheeler–Feynman time-symmetric theory), named after its originators, the physicists Richard Feynman and John Archibald Wheeler, is an interpretation of electrodynamics derived from the assumption that the solutions of the electromagnetic field equations must be invariant under time-reversal transformation, as are the field equations themselves.
New!!: Computer algebra and Wheeler–Feynman absorber theory · See more »
William E. Caswell
William Edward Caswell (June 22, 1947 – September 11, 2001) was a physicist who died during the September 11 attacks, as a passenger aboard American Airlines Flight 77, which was crashed into the Pentagon.
New!!: Computer algebra and William E. Caswell · See more »
Wolfram Language
The Wolfram Language is a general multi-paradigm programming language developed by Wolfram Research and is the programming language of the mathematical symbolic computation program Mathematica and the Wolfram Programming Cloud.
New!!: Computer algebra and Wolfram Language · See more »
20th century in science
Science advanced dramatically during the 20th century.
New!!: Computer algebra and 20th century in science · See more »
Redirects here:
Algebraic algorithms, Algebraic computation, Computational algebra, Simplification (symbolic computation), Symbolic Reasoning, Symbolic and algebraic computation, Symbolic calculation, Symbolic computation, Symbolic computing, Symbolic differentiation, Symbolic expression, Symbolic math, Symbolic mathematics, Symbolic maths, Symbolic processing, Symbolic reasoning.
References
[1] https://en.wikipedia.org/wiki/Computer_algebra