cholesky::factory() - Code Metrics - ghostjat/Np - Measure and Improve Code Quality continuously with Scrutinizer

cholesky::factory() A
last analyzed 2024-03-21 13:34 UTC

↳ Parent: cholesky

Complexity

Conditions	5
Paths	5

Size

Total Lines	14
Code Lines	10

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
cc	5
eloc	10
nc	5
nop	1
dl	0
loc	14
rs	9.6111
c	0
b	0
f	0

<?php

declare (strict_types=1);

namespace Np\linAlgb\decompositions;

use Np\matrix;
use Np\core\lapack;

/**
 * Cholesky
 *
 * An efficient decomposition of a square positive definite matrix into a
 * lower triangular matrix and its conjugate transpose.
 * 
 * @package Np
 * @category Scientific Library
 * @author ghost (Shubham Chaudhary)
 * @email [email protected]
 * @copyright (c) 2020-2021, Shubham Chaudhary
 */
class cholesky {

    /**
     * 
     * @param matrix $m
     * @return matrix|null
     * 
     */
    public static function factory(matrix $m): matrix|null {
        if ($m->isSquare()) {
            $ar = $m->copy();
            $lp = lapack::potrf($ar);
            if ($lp != 0) {
                return null;
            }
            for ($i = 0; $i < $m->col; ++$i) {
                for ($j = $i + 1; $j < $m->col; ++$j) {
                    $ar->data[$i * $m->col + $j] = 0.0;
                }
            }
            unset($lp);
            return $ar;
        }
    }

}


1			<?php
2
3			declare (strict_types=1);
4
5			namespace Np\linAlgb\decompositions;
6
7			use Np\matrix;
8			use Np\core\lapack;
9
10			/**
11			* Cholesky
12			*
13			* An efficient decomposition of a square positive definite matrix into a
14			* lower triangular matrix and its conjugate transpose.
15			*
16			* @package Np
17			* @category Scientific Library
18			* @author ghost (Shubham Chaudhary)
19			* @email [email protected]
20			* @copyright (c) 2020-2021, Shubham Chaudhary
21			*/
22			class cholesky {
23
24			/**
25			*
26			* @param matrix $m
27			* @return matrix\|null
28			*
29			*/
30			public static function factory(matrix $m): matrix\|null {
31			if ($m->isSquare()) {
32			$ar = $m->copy();
33			$lp = lapack::potrf($ar);
34			if ($lp != 0) {
35			return null;
36			}
37			for ($i = 0; $i < $m->col; ++$i) {
38			for ($j = $i + 1; $j < $m->col; ++$j) {
39			$ar->data[$i * $m->col + $j] = 0.0;
40			}
41			}
42			unset($lp);
43			return $ar;
44			}
45			}
46
47			}
48

ghostjat / Np

cholesky::factory() A last analyzed 2024-03-21 13:34 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

cholesky::factory() A
last analyzed 2024-03-21 13:34 UTC