File: t_GramSchmidtAlgorithm_std.py

package info (click to toggle)
openturns 1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 38,588 kB
  • ctags: 26,495
  • sloc: cpp: 144,032; python: 26,855; ansic: 7,868; sh: 419; makefile: 263; yacc: 123; lex: 44
file content (31 lines) | stat: -rwxr-xr-x 869 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#! /usr/bin/env python

from __future__ import print_function
from openturns import *
from math import *

TESTPREAMBLE()

try:
    def clean(inPoint):
        dim = inPoint.getDimension()
        for i in range(dim):
            if abs(inPoint[i]) < 1.e-10:
                inPoint[i] = 0.0
        return inPoint

    iMax = 5
    distribution = Triangular(-1.0, 0.3, 1.0)
    algo = GramSchmidtAlgorithm(distribution)
    print("algo=", repr(algo))
    for i in range(iMax):
        print(distribution.getClassName() + " polynomial(", i, ")=",
              clean(algo.getRecurrenceCoefficients(i)))
    algo.setReferenceFamily(
        OrthogonalUniVariatePolynomialFamily(LegendreFactory()))
    print("Reference family=", algo.getReferenceFamily())

except:
    import sys
    print("t_GramSchmidtAlgorithm_std.py",
          sys.exc_info()[0], sys.exc_info()[1])