代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/494289/6381508
cpp hilbert.cpp
/*
* Solve set of linear equations involving
* a Hilbert matrix
* i.e. solves Hx=b, where b is the vector [1,1,1....1]
*
* Requires: flash.cpp
*
* Copyright (c) Shamus Software 19
www.eeworm.com/read/493843/6391482
m glev.m
function x=glev(r,b)
%GLEV Levinson recursion.
%----
%USAGE: x = glev(r,b)
%
% The Levinson recursion solves the Toeplitz equations
% R x = b
% where R=toeplitz(r) and b is an arbitrary vect
www.eeworm.com/read/482678/6621236
m robustmest.m
function [p, w] = robustMest(A,b,CB,SC);
% ROBUSTMEST - Robust M-estimator
% Solves the problem A*x=b using a robust M-estimator (iterative WLS with Beaton
% and Tukey's weighting function)
%
% R
www.eeworm.com/read/347943/11626527
m fwdpr1.m
% y = fwdpr1(Lden, b)
% FWDPR1 Solves "PROD_k L(pk,betak) * y = b", where
% where L(p,beta) = eye(n) + tril(p*beta',-1).
%
% **********
www.eeworm.com/read/158297/11627101
m crt.m
function x = crt(a,m);
% This function solves the Chinese Remainder Theorem problem:
% x= a(1) mod m(1)
% x= a(2) mod m(2)
% ...
% x= a(r) mod m(r)
% The values for a and m should be a vector
www.eeworm.com/read/156908/11752947
cpp hilbert.cpp
/*
* Solve set of linear equations involving
* a Hilbert matrix
* i.e. solves Hx=b, where b is the vector [1,1,1....1]
*
* Requires: flash.cpp
*
* Copyright (c) Shamus Software 19
www.eeworm.com/read/259756/11768564
m simple.m
function simple
% SIMPLE solves Poisson equation with Dirichlet boundaray condition in a
% L-shaped domain with FEM using uniform mesh refinement.
%
% L. Chen & C. Zhang 10-16-2006
%---------------
www.eeworm.com/read/343744/11930779
m augm.m
function x = augm(A,b,alpha,N)
% AUGM Solution of sparse linear least squares problems.
%
% x=augm(A,b,alpha,N) solves the sparse linear least squares problem
% min ||Ax-b||
www.eeworm.com/read/154209/11983693
c tridisolve.c
/*
* function y = tridisolve(e,d,b,n);
* TRIDISOLVE
* Solves a symmetric, tridiagonal system
* A = diag(E,-1) + diag(D,0) + diag(E,1)
* TRIDISOLVE(E,D,B,N)
* Algorithm from Go
www.eeworm.com/read/254526/12132615
m bslashtx.m
function x = bslashtx(A,b)
% 被交互实验trylu调用
% BSLASHTX Solve linear system (backslash)
% x = bslashtx(A,b) solves A*x = b
[n,n] = size(A);
% Triangular factorization
[L,U,p] = lutx(A);