HP Voyager Programs
For HP-15C

This program provides a fast way to fill a matrix – generally cuts keystroke overhead in half.

When flag 8 is set, the real & complex parts of the number in the X stack level are used to fill consecutive matrix elements resulting in a C format matrix. This behavior is handy if we need to do computation with the elements before we store them – like converting them to rectangular form with →R. On the other hand, if the complex matrix elements are known and in rectangular format, then it may be faster to clear flag 8 and enter the real and complex parts separately.

• Operation
  • Run the program with the following inputs:
    • Z: A matrix descriptor or number 0 (a 0 indicates the A matrix should be used)
    • Y: number of rows
    • X: Number of columns
  • The matrix element coordinate will appear on the display in r.c format.
  • The previously entered element, if there was one, will be on level Y of the stack.
  • Enter the value for the matrix position and press R/S.
    • If flag 8 is set, then the real and complex parts will be placed into the matrix in consecutive positions.
  • Repeat until all the matrix elements have been entered.
  • Note the program never ends – it just wraps back to the start.

• Internal Labels:
  • 7 Program label
  • .7 Main loop target
  • .6 Complex if target
• External Labels:
  • None
• Registers Used:
  • R0 Matrix indexing
  • R1 Matrix indexing
  • I Matrix descripter
• Matrices:
  • Matrix on stack level X when the program starts, or matrix A if X was zero.

This program provides a fast way interate over the elements of a real or complex matrix.

• Operation
  • Run the program with the matrix descriptor or the number 0 in stack level X.
    • If X is zero, then the RESULT matrix will be used.
  • Press R/S until all you have seen the elements you need
    • Note the program will wrap around to the first element after the last one is displayed – this is a feature.
    • If flag 8 is set, then pairs of elements are pulled from the matrix and placed on the stack as complex numbers

• Internal Labels:
  • 4 Program label
  • .4 Main loop target
  • .8 Complex if target
• External Labels:
  • None
• Flags:
  • 8 – Option flag (complex mode)
  • 9 – CF used as NOP
• Registers Used:
  • R0 Matrix indexing
  • R1 Matrix indexing
  • I Matrix descripter
• Matrices:
  • Matrix on stack level X when the program starts, or RESULT if X was zero.

This program solves the system \(AX=B\) for \(X\).

• Program start conditions
  • The \(A\) matrix is assumed to be in A.
    • It may be an \(n\times n\) real matrix, or an \(n\times 2n\) complex matrix in C format.
    • The program determines real vs. complex from the matrix size.
  • The \(B\) matrix in B.
  • Flag 1 is set appropriately:
    • Clear: Use more memory, but preserve contents of A.
    • Set: Use less memory, but destroy contents of A.
• Program end conditions
  • The system "solution", \(X\), will be in C. Note this might not be a valid solution if \(A\) is singular!
  • B is left unchanged!
  • The matrix descriptor for C will be in stack position Y.
  • Matrix C will be selected as the RESULT matrix.
  • Both R0 & R1 will contain 1 in expectation USER mode will be used to visit the elements of C.
  • If \(A\) is a real matrix:
    • Flag 0 will be clear
    • \(\vert A\vert\) is in stack position X
    • The LU factorization of \(A\) is in E when flag 1 is clear, and in A otherwise
  • If \(A\) is a complex matrix
    • Flag 0 will be set
    • \(\mathrm{abs}(\vert A\vert)\) is in stack position X
    • The LU factorization of \(\tilde{A}\) is in E when flag 1 is clear, and in A otherwise

• Internal Labels:
  • 8 Program label
• External Labels:
  • 9 Subroutine to compute determinant
• Flags:
  • 0 – Status flag
  • 1 – Option flag
• Registers:
  • None
• Matrices:
  • A
  • B
  • C
  • E – only when flag 1 is clear

• Program start conditions
  • The \(A\) matrix is assumed to be in A.
    • It may be an \(n\times n\) real matrix, or an \(n\times 2n\) complex matrix in C format.
    • The program determines real vs. complex from the matrix size.
  • flag 1 is set appropriately:
    • Clear: Use more memory, but preserve contents of A.
    • Set: Use less memory, but destroy contents of A.
• Program end conditions
  • The previous contents of the stack are lost
  • If flag 1 is clear
    • A is left unchanged!
    • RESULT matrix set as E
  • If flag 1 is set
    • RESULT matrix set as A
  • \(A\) is a real matrix
    • Flag 0 will be clear
    • The \(\vert A\vert\) is in stack position X
    • The LU factorization of \(A\) is in E when flag 1 is clear, and in A otherwise
  • If \(A\) is a complex matrix
    • Flag 0 will be set
    • \(\mathrm{abs}(\vert A\vert)\) is in stack position X
    • The LU factorization of \(\tilde{A}\) is in E when flag 1 is clear, and in A otherwise

• Internal Labels:
  • 9 – Program label
  • .9 – Conditional label
• External Labels:
  • N/A
• Flags:
  • 0 – exit flag
  • 1 – option flag
• Registers:
  • N/A
• Matrices:
  • A
  • E – only when flag 1 is clear