patch #9691: [octave forge] (linear-algebra) Modular Inverse Matrices using the Gauss-Jacques Method

 Submitter: None Submitted: Tue 18 Sep 2018 05:57:17 PM UTC Category: Forge : new function Priority: 5 - Normal Status: Need Info Privacy: Public Assigned to: None Originator Email: -email is unavailable- Open/Closed: Open
* Mandatory Fields

Add a New Comment Rich Markup

Discussion

Thu 07 Mar 2019 12:51:32 AM UTC, comment #2:

I guess this would go in the linear-algebra package? Leaving open awaiting updates to see if the OP will continue working on this.

Mike Miller <mtmiller>
Tue 18 Sep 2018 10:54:51 PM UTC, comment #1:

Hi,

Thanks this looks interesting.
However the code needs quite some formal work.

Among the most important it needs documentation (i.e. help for users ot learn how to use the function). This is the text you get when you run, for example `help sqp`. You can start looking inside that function (find it using `which sqp`) and write a docstring. If you do that, others will take over and improve it.

Another helpful thing would be to have a couple of demos. for example a simple problem that can be verified with pencil and paper; and another fancy one. This, again, helps the user understand how to use your function and for what it can be useful.

Finally, you could add some tests, so when changes start being applied to your function we are sure we are not destroying functionality or adding new bugs.

https://octave.org/doc/interpreter/Test-and-Demo-Functions.html#Test-and-Demo-Functions
https://octave.org/doc/v4.0.0/Documentation-Tips.html

Juan Pablo Carbajal <juanpi>
Tue 18 Sep 2018 05:57:17 PM UTC, original submission:

It is a function in Octave to obtain modular inverse matrices using the Gauss-Jacques method. Given a n x n square matrix and a modulo m, the function invmodJac returns its modular inverse matrix.

The process does not use determinants neither the adjoint matrix.

With this function we can get bigger modular inverse matrices.

Gauss-Jacques method is published in a scientific indexed journal at:

This is useful in computer science research, such as Cryptography.

Its polynomial is: f(n, m)=((n3)+((n2-n)/2)+(m2+m)), where n stands for the size of the matrix, and m stands for the modulo m.

Anonymous

Attached Files

(Note: upload size limit is set to 16384 kB, after insertion of the required escape characters.)

Attach Files:

Comment:

Attached Files
file #45037:  InvModJacques.m added by None (2KiB - application/octet-stream - Linear Algebra; numerical analysis)
file #45038:  callOnFunction.m added by None (558B - application/octet-stream - Linear Algebra; numerical analysis)

Dependencies

Depends on the following items: None found

Items that depend on this one

Digest:
patch dependencies.

Carbon-Copy List
• -email is unavailable- added by juanpi (Posted a comment)
• -email is unavailable- added by None (Submitted the item)
•

There are 0 votes so far. Votes easily highlight which items people would like to see resolved in priority, independently of the priority of the item set by tracker managers.

Only logged-in users can vote.