代码搜索：Matrices
找到约 3,616 项符合「Matrices」的源代码
代码结果 3,616
www.eeworm.com/read/266537/11220127
c matrix.c
/* University of Ulm Programming Contest 1996
Problem G: Matrix Chain Multiplication
Implementation: Mark Dettinger */
#include
typedef struct {int mults; int rows; int cols;} triple
www.eeworm.com/read/265706/11256038
m runpf.m
function [MVAbase, bus, gen, branch, success, et] = runpf(casename, mpopt, fname, solvedcase)
%RUNPF Runs a power flow.
%
% [baseMVA, bus, gen, branch, success, et] = ...
% runpf(casename
www.eeworm.com/read/265447/11264076
out mod2convert-test.out
Creating sparse matrix.
Converting from sparse to dense.
Converting back to dense again.
Testing for equality of two sparse matrices: OK.
Converting to dense once again.
Testing for equality of two d
www.eeworm.com/read/334951/12558181
cpp xqrupdt.cpp
#include
#include
#include
#include
#include "nr.h"
using namespace std;
// Driver for routine qrupdt
int main(void)
{
bool sing;
www.eeworm.com/read/334951/12558563
cpp xludcmp.cpp
#include
#include
#include
#include
#include "nr.h"
using namespace std;
// Driver for routine ludcmp
int main(void)
{
int j,k,l,m,n,dum;
www.eeworm.com/read/334951/12558627
cpp xqrdcmp.cpp
#include
#include
#include
#include
#include "nr.h"
using namespace std;
// Driver for routine qrdcmp
int main(void)
{
bool sing;
www.eeworm.com/read/111585/15509747
m poldif.m
function DM = poldif(x, malpha, B)
% The function DM = poldif(x, maplha, B) computes the
% differentiation matrices D1, D2, ..., DM on arbitrary nodes.
%
% The function is called with either two
www.eeworm.com/read/104632/15686557
txt a_progr.txt
Try the examples in this order.
(You can compile the *.c files directly without create a project)
a) Basic matrices functions :
addmF(R).c : Add two matrices.
submF(R).
www.eeworm.com/read/102394/15784082
todo
* Document Jacobi eigen function, in particular that it only works for
symmetric matrices.
www.eeworm.com/read/100395/15874828
html sparse.html
Newmat09 - sparse
Sparse matrices
next -
skip -
up -