[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Savannah-register-public] [task #15045] Submission of Gauss-Jacques met

From: Abraham Jacques
Subject: [Savannah-register-public] [task #15045] Submission of Gauss-Jacques method
Date: Mon, 17 Sep 2018 13:11:31 -0400 (EDT)
User-agent: Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/65.0.3325.162 Safari/537.36


                 Summary: Submission of Gauss-Jacques method
                 Project: Savannah Administration
            Submitted by: abejacques
            Submitted on: Mon 17 Sep 2018 05:11:30 PM UTC
         Should Start On: Mon 17 Sep 2018 12:00:00 AM UTC
   Should be Finished on: Thu 27 Sep 2018 12:00:00 AM UTC
                Category: Project Approval
                Priority: 5 - Normal
                  Status: None
                 Privacy: Public
        Percent Complete: 0%
             Assigned to: None
             Open/Closed: Open
         Discussion Lock: Any
                  Effort: 0.00



A new project has been registered at Savannah 
This project account will remain inactive until a site admin approves
or discards the registration.

= Registration Administration =

While this item will be useful to track the registration process,
*approving or discarding the registration must be done using the specific
Group Administration
<> page*,
accessible only to site administrators,
effectively *logged as site administrators* (superuser):

* Group Administration

= Registration Details =

* Name: *Gauss-Jacques method*
* System Name:  *modularinverse*
* Type: non-GNU software and documentation
* License: GNU General Public License v2 or later (Safe Creative Licence

URL Inf:

URL certified publication


==== Description: ====
It is a brand new method to obtain modular inverse matrices sized n x n
considering computational efficiency and applications in symmetric
This method is published at address@hidden:

address@hidden is a scientific indexed magazine.

This method is computationally efficient and does not use determinants and the
adjoint matrix in its calculation. 

Bigger modular inverse matrices can be obtained than the existing functions.

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 to work with.

==== Tarball URL: ====


Reply to this item at:


  Message sent via Savannah

reply via email to

[Prev in Thread] Current Thread [Next in Thread]