# New Numerical Functions in Mathcad Prime 3.0

In addition to the documenting features, conversion ease and performance improvements, Mathcad Prime 3.0 will introduce new numerical improvements. One interesting enhancement is the new Matrix Factorization Functions, which are an essential tool in linear algebra applications. These advances will improve direct solution of linear systems, forming matrix inverse and obtaining least square solution to over-determined systems.

Historically, Mathcad offered four matrix factorization functions:

1. Singular value decomposition (SVD) – A matrix is decomposed into product of unitary matrix, a rectangular diagonal matrix and the conjugate transpose of the unitary matrix. This factorization is used in many signal processing and statistics applications.

2. LU Decomposition (also called LU factorization) – A matrix is factorized into the product of a lower and upper triangular matrices. This used frequently to solve linear systems of equations which is used to solve many discrete and continuous mechanical and electrical systems

3. QR Decomposition (also called QR factorization) – A matrix is decomposed into the product of an orthogonal matrix and an upper triangular matrix. This factorization is often used to solve linear least squares and eigenvalue problems.

4. Cholesky Decomposition – Where a Hermitian positive matrix is decomposed into the product of a lower triangular matrix and its conjugate transpose often used to solve linear systems of equations.

Mathcad Prime 3.0 will introduce the following enhancement to LU, QR and Cholesky decompositions:

• Full pivoting support and enhanced stability
• Significant Performance improvement
• Full complex numbers support
• Full generalization

In addition, the new decomposition functions will support non-square matrices (i.e. n≠m). As well as the option to turn pivoting on and off. Below is a table with a summary of the introduced enhancements:

New enhancements for Mathcad Prime 3.0

In summary, these new numerical matrix factorization enhancements will allow engineers more flexibility in solving a wider set of more complex linear algebra problems and solve them at faster speeds with greater ease.

This entry was posted in Mathcad, The Inside Scoop and tagged , , , , , . Bookmark the permalink.

## 9 thoughts on “New Numerical Functions in Mathcad Prime 3.0”

1. John Archer says:

Will Prime features be migrated to Mathcad 15?
Will there be a 64 bit Mathcad 15?
Migration of older programs to Prime has got to be improved. Right now it compares to Socialism; it looks great on paper.

2. Since it is using Intel’s MKL will the features work on AMD systems

1. Jakov Kucan says:

Yes. It will work on AMD systems as well.

1. Can you post some benchmarks with Intel and AMD CPUs. wanna know which one should I buy specially for running Mathcad.

2. myschizobuddy says:

Will it scale with Multiple CPUs as well?

3. anobile137 says:

What is scheduled release date? Hurry! Prime 2 has lots of problems. I hope they are fixed. See my post on the Prime 2 blog.

4. Anna Giangregorio says:

Hi there, the plan is for PTC Mathcad Prime 3.0 to be released in late spring or early summer of 2013.

5. Andres Denss says:

One of the most annoying features that is missing in MathCad Prime 2.0 is that you can’t split a long equation over multiple lines as you could in MathCad 15 with CNTRL ENTER.

Is this feature now implemented in MathCAD Prime 3.0 ?

6. A post in the PTC blog prompts me to “Download now!” Mathcad Prime V3. That was posted in september 17…but I tried several ways to download this new release but in the PTC site all is refered to Prime V2.