代码搜索：Multiplication
找到约 1,176 项符合「Multiplication」的源代码
代码结果 1,176
www.eeworm.com/read/146126/12668476
cpp recursivedpmatrixchain.cpp
// first version of recursive dynamic programming solution for
// the matrix multiplication chains problem
#include
#include "make2dArray.h"
using namespace std;
// global variab
www.eeworm.com/read/241323/13156424
m restun.m
%> The file calculates the transmission coefficient for the
%> 1D Schrodinger equation using multiplication of transfer matrices
%> which are calculated using Airy functions.
%> The potent
www.eeworm.com/read/318176/13484172
c mrmonty.c
/*
* MIRACL Montgomery's method for modular arithmetic without division.
* mrmonty.c
*
* Programs to implement Montgomery's method
* See "Modular Multiplication Without Trial Divisi
www.eeworm.com/read/134479/5892668
br spmatrixvec.br
/*
Sparse Matrix-Vector Multiply
Simple example of how to perform a sparse matrix vector multiplication
(y = Ax) where the sparse matrix A is represented in padded compressed
sparse row, a
www.eeworm.com/read/100601/6267371
c mptest-3a.c
/*
* Simple test driver for MPI library
*
* Test 3a: Multiplication vs. squaring timing test
*
* The contents of this file are subject to the Mozilla Public
* License Version 1.1 (the "License")
www.eeworm.com/read/100601/6267400
txt square.txt
Squaring Algorithm
When you are squaring a value, you can take advantage of the fact that
half the multiplications performed by the more general multiplication
algorithm (see 'mul.txt' for a descript
www.eeworm.com/read/494289/6381587
c mrmonty.c
/*
* MIRACL Montgomery's method for modular arithmetic without division.
* mrmonty.c
*
* Programs to implement Montgomery's method
* See "Modular Multiplication Without Trial Divisi
www.eeworm.com/read/156908/11753179
c mrmonty.c
/*
* MIRACL Montgomery's method for modular arithmetic without division.
* mrmonty.c
*
* Programs to implement Montgomery's method
* See "Modular Multiplication Without Trial Divisi
www.eeworm.com/read/259580/11780229
cpp recursivedpmatrixchain.cpp
// first version of recursive dynamic programming solution for
// the matrix multiplication chains problem
#include
#include "make2dArray.h"
using namespace std;
// global variab
www.eeworm.com/read/307266/3726045
c mrmonty.c
/*
* MIRACL Montgomery's method for modular arithmetic without division.
* mrmonty.c
*
* Programs to implement Montgomery's method
* See "Modular Multiplication Without Trial Divisi