/* * Copyright (c) 2021, Alliance for Open Media. All rights reserved. * * This source code is subject to the terms of the BSD 2 Clause License and * the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License * was not distributed with this source code in the LICENSE file, you can * obtain it at www.aomedia.org/license/software. If the Alliance for Open * Media Patent License 1.0 was not distributed with this source code in the * PATENTS file, you can obtain it at www.aomedia.org/license/patent.
*/
// Number of iterations for solving linear equations. #define MAX_CG_SP_ITER 100
typedefstruct { int n_elem; // number of non-zero elements int n_rows; int n_cols; // using arrays to represent non-zero elements. int *col_pos; int *row_pos; // starts with 0 double *value;
} SPARSE_MTX;
int av1_init_sparse_mtx(constint *rows, constint *cols, constdouble *values, int num_elem, int num_rows, int num_cols,
SPARSE_MTX *sm); int av1_init_combine_sparse_mtx(const SPARSE_MTX *sm1, const SPARSE_MTX *sm2,
SPARSE_MTX *sm, int row_offset1, int col_offset1, int row_offset2, int col_offset2, int new_n_rows, int new_n_cols); void av1_free_sparse_mtx_elems(SPARSE_MTX *sm);
int av1_conjugate_gradient_sparse(const SPARSE_MTX *A, constdouble *b, int bl, double *x); int av1_bi_conjugate_gradient_sparse(const SPARSE_MTX *A, constdouble *b, int bl, double *x); int av1_jacobi_sparse(const SPARSE_MTX *A, constdouble *b, int bl, double *x); int av1_steepest_descent_sparse(const SPARSE_MTX *A, constdouble *b, int bl, double *x);
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.