Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Spire.PDF for Java 2.7.8
Database Workbench Pro 5.6.10.0
The C# PDF Library 2020.1.5
CAD-Viewer 3DVBVIEW V4
dotConnect for SQLite 5.15
LuaStudio 9.92
EntityDAC 2.3
Devart ODBC Driver for QuickBooks 2.0
phpEnter 5.1.
Udemy Clone script 2.01
VisualNEO Web 19.11.7
VisualNEO for Windows 19.4.29.0
SentiVeillance SDK Trial 7.3
Devart ODBC Driver for PostgreSQL 3.2
SecureBridge 9.2
Top Code
Simple Fuzzy Control Demonstration 1.0
Poker Forum Hand Posting Script for Scripts 1.0
Abakus VCL (Demo) 2.0
Add Comments Script 1.0
Top Rated
phpEnter 5.1.
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Fast Fourier Transform based Homogenization 1.0
File ID: 84747






Fast Fourier Transform based Homogenization 1.0
Download Fast Fourier Transform based Homogenization 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 399.4 KB
Downloads: 36
Submit Rating:
Fast Fourier Transform based Homogenization 1.0 Description
Description: Implementation of Fast Fourier Transform based Homogenization for heterogeneous materials dealing with electric or heat conductiviy. It takes the values of conductivity at regular grid of periodic unit cell that represents the material and produces the distribution of local fields such as electric field and electric current or temperature gradient or heat flux. The effective conductivity matrix is also produced. The algorithm works both in two and three-dimensional case.

License: Shareware

Related: Field, current, fields, Local, produces, Distribution, Temperature, Gradient, Works, threedimensional

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 399.4 KB

Downloads: 36



More Similar Code

This program is open source code of fast Fourier transform in matlab.
Where y is the input argument and p is the normalized size of the input. Let
y = [1 2 3 4 ];
x= length(y);
m= log2(x);
p= ceil(m);
To call the function use
ft2(y,p);



This program calculates the non-destructive zoom Fast Fourier transform of a time history.

The input file must be time(sec) and amplitude(units)

Reference: Randall, Frequency Analysis, Bruel & Kjaer, page 170.



Computes by using the FFT (fast Fourier transform) algorithm the covolution of two discrete sequences.



Tiny-DSP library contains c sources of a fast, tiny, portable and generic FFT (Fast Fourier transform) and inverse FFT. Supported are all power of two sizes (like 2,4,8,16,32,...) for one and two dimensional floating point arrays.



The unit FOURIER contains the fast Fourier transform (FFT) component TFastFourier which can be installed into the VCL. TFastFourier can transform data sets of up to 32k samples in both directions and provides several of the most important...



six different DCT (Discrete Cosine Transform based image fusion techniques are presented
Image fusion using DCT based demo programme is presented.



The Fourier transform takes a signal in the time domain and maps it, without loss of information, into the frequency domain. The frequency domain representation is exactly the same signal, in a different form. The inverse Fourier transform(IDFT)...



Generation of signal with extra parameters

Detection using;
Fast Fourier Transform Algorithm
Goertzel Algorithm
Digital Filtering (FIR Filter bank)



function [g] = FFTPF1D (X,binsize, f, P)
Discrete Fourier Transform Low/High Pass Filter.
% This is a simply implement of such a filter for a given 1-D data.
X: the array of you data, each data point is a bin of signal
...



This function returns N point DFT samples of 2dw band of Fourier transform of a sequence. Typically, fft() returns N samples of Fourier transform ranging from 0 to 2pi. This function takes the N-point DFT samples and returns N-point samples...

User Review for Fast Fourier Transform based Homogenization
- required fields
     

Please enter text on the image